1480 search results - page 225 / 296 » Ants can solve constraint satisfaction problems |
113
click to vote
ICML
2009
IEEE
16 years 20 days ago
2009
IEEE
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
ISPD
2000
ACM
15 years 4 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
112
click to vote
UIST
1997
ACM
15 years 3 months ago
1997
ACM
We propose interactive beautification, a technique for rapid geometric design, and introduce the technique and its algorithm with a prototype system Pegasus. The motivation is to ...
110
click to vote
ICIP
2004
IEEE
16 years 1 months ago
2004
IEEE
In this paper, we propose an optimal unequal error protection scheme for object-based video communications over differentiated services networks. Our goal is to achieve the best v...
129
click to vote
POPL
1992
ACM
15 years 3 months ago
1992
ACM
Semantics for a Higher-Order Functional Language with Logic Variables Radha Jagadeesan Imperial College, London, UK SW7 2BZ. Keshav Pingali Cornell University, Ithaca, NY 14853. A...