Sciweavers

297 search results - page 37 / 60
» Towards a Parallel Search for Solutions of Non-deterministic...
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
ECIR
2008
Springer
13 years 10 months ago
Efficient Multimedia Time Series Data Retrieval Under Uniform Scaling and Normalisation
As the world has shifted towards manipulation of information and its technology, we have been increasingly overwhelmed by the amount of available multimedia data while having highe...
Waiyawuth Euachongprasit, Chotirat Ann Ratanamahat...
COCOON
1998
Springer
14 years 20 days ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
14 years 2 months ago
Is the island model fault tolerant?
In this paper, we present a study on the fault tolerance nature of the island model when applied to Genetic Algorithms. Parallel and distributed models have been extensively appli...
José Ignacio Hidalgo, Juan Lanchares, Franc...
ADHOCNOW
2009
Springer
14 years 3 months ago
Auction Aggregation Protocols for Wireless Robot-Robot Coordination
Abstract. Robots coordinate among themselves to select one of them to respond to an event reported to one of robots. The goal is to minimize the communication cost of selecting bes...
Ivan Mezei, Veljko Malbasa, Ivan Stojmenovic