804 search results - page 108 / 161 » On the Termination of the Chase Algorithm |
102
click to vote
SODA
2000
ACM
15 years 2 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
102
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
This paper begins by reviewing different methods of automatic programming while emphasizing the technique of Ant Programming (AP). AP uses an ant foraging metaphor in which ants g...
MP
2006
15 years 18 days ago
2006
Determining if a solution is optimal or near optimal is fundamental in optimization theory, algorithms, and computation. For instance, Karush-Kuhn-Tucker conditions provide necessa...
157
click to vote
MONET
2011
14 years 7 months ago
2011
Abstract The use of mobile sensors is of great relevance to monitor critical areas where sensors cannot be deployed manually. The presence of data collector sinks causes increased ...
128
click to vote
TON
2010
14 years 7 months ago
2010
Abstract--Energy efficiency is critical for wireless sensor networks. The data-gathering process must be carefully designed to conserve energy and extend network lifetime. For appl...