1204 search results - page 126 / 241 » Termination of Polynomial Programs |
90
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
Sampling conditions for recovering the homology of a set using topological persistence are much weaker than sampling conditions required by any known algorithm for producing a top...
93
Voted
ASPDAC
2001
ACM
15 years 4 months ago
2001
ACM
Wirelength estimation techniques typically contain a site density function that enumerates all possible path sites for each wirelength in an architecture and an occupation probabil...
128
click to vote
TON
2010
14 years 7 months ago
2010
Abstract--Energy efficiency is critical for wireless sensor networks. The data-gathering process must be carefully designed to conserve energy and extend network lifetime. For appl...
173
Voted
AIPS
2011
14 years 4 months ago
2011
We define a probe to be a single action sequence computed greedily from a given state that either terminates in the goal or fails. We show that by designing these probes carefull...
102
Voted
STOC
2004
ACM
16 years 1 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...