2109 search results - page 309 / 422 » Solving Necklace Constraint Problems |
136
click to vote
CIA
2008
Springer
15 years 6 months ago
2008
Springer
Network devices can filter traffic in order to protect end-user computers against network worms and other threats. Since these devices have very limited memories and cannot deploy ...
120
click to vote
AAAI
2010
15 years 6 months ago
2010
Multiple Kernel Learning (MKL) can be formulated as a convex-concave minmax optimization problem, whose saddle point corresponds to the optimal solution to MKL. Most MKL methods e...
129
click to vote
DAM
2008
15 years 4 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
136
click to vote
AMAI
2005
Springer
15 years 4 months ago
2005
Springer
Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their e ective use requires the solution of hard query optimization problems. This is usuall...
125
click to vote
ALGORITHMICA
2002
15 years 4 months ago
2002
We study exploration problems where a robot has to construct a complete map of an unknown environment using a path that is as short as possible. In the rst problem setting we cons...