1176 search results - page 166 / 236 » Theory and Applications of Robust Optimization |
104
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
SPAA
2005
ACM
15 years 5 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
IUI
2004
ACM
15 years 5 months ago
2004
ACM
In order to give people ubiquitous access to software applications, device controllers, and Internet services, it will be necessary to automatically adapt user interfaces to the c...
ATAL
2003
Springer
15 years 5 months ago
2003
Springer
Auctions are useful mechanism for allocating items (goods, tasks, resources, etc.) in multiagent systems. The bulk of auction theory assumes that the bidders’ valuations for ite...
100
click to vote
GECCO
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we present the application of an evolution strategy to the problem of detecting multi-planet transit events in photometric time-data series. Planetary transits occur...