2027 search results - page 122 / 406 » When is it best to best-respond |
119
click to vote
VR
2000
IEEE
15 years 5 months ago
2000
IEEE
Previous interactive works have used springs, heuristics, and dynamics for surface placement applications. We present an analytical technique for kilohertz rate manipulation of CA...
131
click to vote
ICCAD
1997
IEEE
15 years 5 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
152
Voted
ELPUB
2007
ACM
15 years 5 months ago
2007
ACM
For national advisory services in the UK (UKOLN, CETIS, and OSS Watch), varieties of openness (open source software, open standards, and open access to research publications and d...
ADBIS
2001
Springer
15 years 4 months ago
2001
Springer
In this paper, the most appropriate buffer structure, page replacement policy and buffering scheme for closest pairs queries, where both spatial datasets are stored in R-trees, are...
100
click to vote
AAAI
2008
15 years 3 months ago
2008
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small prob...