Sciweavers

920 search results - page 95 / 184
» Generating Satisfiable Problem Instances
Sort
View
104
Voted
CVPR
2008
IEEE
16 years 2 months ago
3D surface models by geometric constraints propagation
This paper proposes a technique for estimating piecewise planar models of objects from their images and geometric constraints. First, assuming a bounded noise in the localization ...
Michela Farenzena, Andrea Fusiello
122
Voted
ICDE
2010
IEEE
254views Database» more  ICDE 2010»
16 years 13 days ago
Efficient Rank Based KNN Query Processing Over Uncertain Data
Uncertain data are inherent in many applications such as environmental surveillance and quantitative economics research. As an important problem in many applications, KNN query has...
Ying Zhang, Xuemin Lin, Gaoping ZHU, Wenjie Zhang,...
84
Voted
SAT
2004
Springer
106views Hardware» more  SAT 2004»
15 years 6 months ago
Local Search with Bootstrapping
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
Lengning Liu, Miroslaw Truszczynski
92
Voted
AI
2003
Springer
15 years 6 months ago
Stochastic Local Search for Multiprocessor Scheduling for Minimum Total Tardiness
The multi-processor total tardiness problem (MPTTP) is an ÆÈ-hard scheduling problem, in which the goal is to minimise the tardiness of a set of jobs that are processed on a numb...
Michael Pavlin, Holger H. Hoos, Thomas Stützl...
GIS
1995
ACM
15 years 4 months ago
Collaborative Spatial Decision Making with Qualitative Constraints
: Usually spatial planning problems involve a large number of decision makers with different backgrounds and interests. The process of Collaborative Spatial Decision Making (CSDM)...
Nikos I. Karacapilidis, Dimitris Papadias, Max J. ...