In this paper, we address the problem of determining optimal hyper-parameters for support vector machines (SVMs). The standard way for solving the model selection problem is to use grid search. Grid search constitutes an exhaustive search over a pre-defined discretized set of possible parameter values and evaluating the cross-validation error until the best is found. We developed a bi-level opt...

Access to mathematical knowledge has changed dramatically in recent years, therefore changing mathematical search practices. Our aim with this study is to scrutinize professional mathematicians’ search behavior. With this understanding we want to be able to reason why mathematicians use which tool for what search problem in what phase of the search process. To gain these insights we conducted 2...

This paper presents a hybrid scavenger grid as an underlying hardware architecture for search services within digital libraries. The hybrid scavenger grid consists of both dedicated servers and dynamic resources in the form of idle workstations to handle mediumto large-scale search engine workloads. The dedicated resources are expected to have reliable and predictable behaviour. The dynamic res...

We present a framework for generalized range search on trie-structured P2P networks, such as P-Grid. Our techniques exploit hitherto unknown properties of randomized tries. We prove that a P-Grid like network has routing diameter O(log n) with high probability, as well as O(log n) congestion, regardless of the shape of the underlying trie. Based on these properties, we propose GRaSP, a simple s...

The Semantic Grid is an extension of the current Grid in which information and services are given well defined and explicitly represented meaning, better enabling computers and people to work in cooperation [1]. Existing Grid Services deal with knowledge in the form of metadata and its associated semantics in an implicit fashion, providing no way to share this knowledge with other Grid componen...

Availability of fast and reliable internet, high speed networks and powerful computers led to the emergence of a new paradigm known as Grid Computing. Grid computing is a form of distributed computing which enables the users to share the heterogeneousresources which are geographically dispersed to solve a complex problem.The heterogeneous nature and tremendous amount of resources makes Grid sch...

Utilizing distributed generations (DGs) near load points has introduced the concept of microgrid. However, stochastic nature of wind and solar power generation as well as electricity load makes it necessary to utilize an energy management system (EMS) to manage hourly power of microgrid and optimally supply the demand. As a result, this paper utilizes demand response program (DRP) and battery t...

In this paper we propose a new path planning method for a robot manipulator in a cluttered static environment, based on lazy grid sampling. Grid cells are built while searching for the path to the goal configuration. The proposed planner acts in two modes. A depth mode while the robot is far from obstacles makes it evolve toward its goal. Then a width search mode becomes active when the robot g...

In this paper we explore a symmetry-based search space reduction technique which can speed up optimal pathfinding on undirected uniform-cost grid maps by up to 38 times. Our technique decomposes grid maps into a set of empty rectangles, removing from each rectangle all interior nodes and possibly some from along the perimeter. We then add a series of macro-edges between selected pairs of remain...