Sciweavers

1208 search results - page 119 / 242
» Uniform eventown problems
Sort
View
CIA
2003
Springer
15 years 3 months ago
A Peer-to-Peer Approach to Resource Discovery in Multi-agent Systems
A multi-agent system is a network of software agents that cooperate to solve problems. In open multi-agent systems, the agents that need resources provided by other agents are not ...
Vassilios V. Dimakopoulos, Evaggelia Pitoura
COLT
1997
Springer
15 years 2 months ago
Estimation of Time-Varying Parameters in Statistical Models: An Optimization Approach
Abstract. We propose a convex optimization approach to solving the nonparametric regression estimation problem when the underlying regression function is Lipschitz continuous. This...
Dimitris Bertsimas, David Gamarnik, John N. Tsitsi...
SODA
2008
ACM
156views Algorithms» more  SODA 2008»
14 years 11 months ago
Approximating TSP on metrics with bounded global growth
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
T.-H. Hubert Chan, Anupam Gupta
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
14 years 11 months ago
IMproved results for route planning in stochastic transportation
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
Justin A. Boyan, Michael Mitzenmacher
CAD
2000
Springer
14 years 9 months ago
Time-critical multiresolution rendering of large complex models
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
Enrico Gobbetti, Eric Bouvier