5356 search results - page 293 / 1072 » Adventures in time and space |
178
click to vote
CP
2003
Springer
15 years 12 months ago
2003
Springer
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
176
Voted
SCCC
2002
IEEE
15 years 11 months ago
2002
IEEE
The compression of binary texts using antidictionaries is a novel technique based on the fact that some substrings (called “antifactors”) never appear in the text. Let × be a...
141
click to vote
WADS
1997
Springer
15 years 11 months ago
1997
Springer
A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. ...
180
click to vote
3DPVT
2004
IEEE
15 years 10 months ago
2004
IEEE
Image based rendering (IBR) consists of several steps: (i) Calibration (or ego-motion computation) of all input images. (ii) Determination of regions in the input images used to s...
174
click to vote
HIS
2008
15 years 8 months ago
2008
Machine scheduling is a critical problem in industries where products are custom-designed. The wide range of products, the lack of previous experiences in manufacturing, and the s...