7522 search results - page 1496 / 1505 » Spacing memetic algorithms |
114
Voted
SIAMCOMP
1998
15 years 8 hour ago
1998
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
99
Voted
TKDE
1998
15 years 3 hour ago
1998
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
134
Voted
TJS
2002
14 years 12 months ago
2002
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
123
Voted
TPDS
2002
14 years 12 months ago
2002
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...
130
Voted
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We consider the problem of revenue-optimal dynamic mechanism design in settings where agents' types evolve over time as a function of their (both public and private) experien...