Sciweavers

1142 search results - page 58 / 229
» Set Variables and Local Search
Sort
View
MOBISYS
2010
ACM
14 years 11 days ago
CrowdSearch: exploiting crowds for accurate real-time image search on mobile phones
Mobile phones are becoming increasingly sophisticated with a rich set of on-board sensors and ubiquitous wireless connectivity. However, the ability to fully exploit the sensing c...
Tingxin Yan, Vikas Kumar, Deepak Ganesan
GECCO
2008
Springer
104views Optimization» more  GECCO 2008»
13 years 11 months ago
Understanding elementary landscapes
The landscape formalism unites a finite candidate solution set to a neighborhood topology and an objective function. This construct can be used to model the behavior of local sea...
Darrell Whitley, Andrew M. Sutton, Adele E. Howe
TPDS
2002
155views more  TPDS 2002»
13 years 9 months ago
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is...
Jie Wu
SLS
2007
Springer
120views Algorithms» more  SLS 2007»
14 years 4 months ago
A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem
This paper introduces the ”block moves” neighborhood for the Multiple Depot Vehicle Scheduling Problem. Experimental studies are carried out on a set of benchmark instances to ...
Benoît Laurent, Jin-Kao Hao
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
14 years 3 months ago
A Hybrid Immune Algorithm with Information Gain for the Graph Coloring Problem
We present a new Immune Algorithm that incorporates a simple local search procedure to improve the overall performances to tackle the graph coloring problem instances. We character...
Vincenzo Cutello, Giuseppe Nicosia, Mario Pavone