Sciweavers

1486 search results - page 99 / 298
» Algorithms for two-box covering
Sort
View
APPROX
2005
Springer
136views Algorithms» more  APPROX 2005»
15 years 9 months ago
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
CORR
2006
Springer
146views Education» more  CORR 2006»
15 years 3 months ago
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
Bodo Manthey, L. Shankar Ram
PDCN
2004
15 years 5 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
WCE
2007
15 years 5 months ago
A Distributed Energy Efficient Query Processing in Self-Organized Wireless Sensor Networks
—Spatial query execution is an essential functionality of a sensor network. Redundancy within a sensor network can be exploited to reduce the communication cost incurred in execu...
Meer A. Hamza, Sherin M. Youssef, Salma F. Fayed
WPES
2006
ACM
15 years 9 months ago
Nonesuch: a mix network with sender unobservability
Oblivious submission to anonymity systems is a process by which a message may be submitted in such a way that neither the anonymity network nor a global passive adversary may dete...
Thomas S. Heydt-Benjamin, Andrei Serjantov, Beness...