503 search results - page 60 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
121
Voted
CP
2004
Springer
15 years 8 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
140
click to vote
ICRA
2006
IEEE
15 years 9 months ago
2006
IEEE
— We address the problem of placing a sensor network so as to minimize the uncertainty in estimating the position of targets. The novelty of our formulation is in the sensing mod...
135
Voted
OPODIS
2010
15 years 1 months ago
2010
We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under less than s...
119
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—We develop diverse routing schemes for dealing with multiple, possibly correlated, failures. While disjoint path protection can effectively deal with isolated single link failur...
129
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...