Sciweavers

429 search results - page 83 / 86
» Improved Algorithms for the k Maximum-Sums Problems
Sort
View
SIGMOD
2008
ACM
123views Database» more  SIGMOD 2008»
15 years 10 months ago
Query-based partitioning of documents and indexes for information lifecycle management
Regulations require businesses to archive many electronic documents for extended periods of time. Given the sheer volume of documents and the response time requirements, documents...
Soumyadeb Mitra, Marianne Winslett, Windsor W. Hsu
MASCOTS
2003
14 years 11 months ago
Minimizing Packet Loss by Optimizing OSPF Weights Using Online Simulation
In this paper, we present a scheme for minimizing packet loss in OSPF networks by optimizing link weights using Online Simulation. We have chosen packet loss rate in the network a...
Hema Tahilramani Kaur, Tao Ye, Shivkumar Kalyanara...
APPROX
2007
Springer
77views Algorithms» more  APPROX 2007»
15 years 4 months ago
High Entropy Random Selection Protocols
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
Harry Buhrman, Matthias Christandl, Michal Kouck&y...
ATAL
2008
Springer
14 years 11 months ago
Adaptive multi-robot wide-area exploration and mapping
The exploration problem is a central issue in mobile robotics. A complete terrain coverage is not practical if the environment is large with only a few small hotspots. This paper ...
Kian Hsiang Low, John M. Dolan, Pradeep K. Khosla
EXPERT
1998
86views more  EXPERT 1998»
14 years 9 months ago
IMACS: A Case Study in Real-World Planning
This article illustrates the complexities of real-world planning and how we can create AI planning systems to address them. We describe the IMACS Project (Interactive Manufacturab...
Satyandra K. Gupta, Dana S. Nau, William C. Regli