8413 search results - page 341 / 1683 » Ordering Problem Subgoals |
134
click to vote
WADS
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. Assumptions about node density in the Sensor Networks literature are frequently too strong or too weak. Neither absolutely arbitrary nor uniform deployment seem feasible ...
153
click to vote
GLOBECOM
2006
IEEE
16 years 20 days ago
2006
IEEE
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...
178
click to vote
ICARCV
2006
IEEE
16 years 20 days ago
2006
IEEE
— Many problems in computer vision such as pose recovery and structure estimation are formulated as a minimization process. These problems vary in the use of image measurements d...
172
click to vote
FATES
2005
Springer
16 years 4 days ago
2005
Springer
The global testing problem studied in this paper is to seek a definite answer to whether a system of concurrent black-boxes has an observable behavior in a given finite (but cou...
191
click to vote
MTV
2003
IEEE
15 years 12 months ago
2003
IEEE
Bounded Model Checking (BMC) techniques have been used for formal hardware verification, with the help of tools such as GRASP (Generic search Algorithm for Satisfiability Proble...