535 search results - page 77 / 107 » Generalized Version Space Trees |
123
Voted
ALGOSENSORS
2009
Springer
15 years 6 months ago
2009
Springer
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
103
click to vote
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
113
click to vote
STOC
2010
ACM
15 years 4 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
112
click to vote
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
DC
2007
14 years 12 months ago
2007
Suppose that some parties are connected by an incomplete network of reliable and private channels. The parties cooperate to execute some protocol. However, the parties are curious...