299 search results - page 16 / 60 » Optimizing Polynomial Solvers for Minimal Geometry Problems |
CDC
2008
IEEE
15 years 7 months ago
2008
IEEE
— The problem of sensor activation in a controlled discrete event system is considered. Sensors are assumed to be costly and can be turned on/off during the operation of the syst...
132
click to vote
TACAS
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
103
Voted
TACAS
2009
Springer
15 years 7 months ago
2009
Springer
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
124
Voted
ROBOCOMM
2007
IEEE
15 years 6 months ago
2007
IEEE
—For the first time, the problem of optimizing energy for communication and motion is investigated. We consider a single mobile robot with continuous high bandwidth wireless com...
108
Voted
NIPS
2007
15 years 1 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....