Sciweavers

20441 search results - page 3875 / 4089
» Locally Computable Structures
Sort
View
FOCS
2005
IEEE
15 years 9 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
INFOCOM
2005
IEEE
15 years 9 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
SAC
2005
ACM
15 years 9 months ago
Graphical rule-based representation of signal-transduction networks
The process by which a cell senses and responds to its environment, as in signal transduction, is often mediated by a network of protein-protein interactions, in which proteins co...
James R. Faeder, Michael L. Blinov, William S. Hla...
136
Voted
SMA
2005
ACM
167views Solid Modeling» more  SMA 2005»
15 years 9 months ago
Boolean operations on 3D selective Nef complexes: optimized implementation and experiments
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
Peter Hachenberger, Lutz Kettner
ATAL
2005
Springer
15 years 8 months ago
Exploiting belief bounds: practical POMDPs for personal assistant agents
Agents or agent teams deployed to assist humans often face the challenges of monitoring the state of key processes in their environment (including the state of their human users t...
Pradeep Varakantham, Rajiv T. Maheswaran, Milind T...
« Prev « First page 3875 / 4089 Last » Next »