6740 search results - page 166 / 1348 » An s -Hamiltonian Line Graph Problem |
124
click to vote
COLT
2003
Springer
15 years 6 months ago
2003
Springer
This paper extends the game-theoretic notion of internal regret to the case of on-line potfolio selection problems. New sequential investment strategies are designed to minimize th...
87
Voted
AE
2009
Springer
15 years 1 months ago
2009
Springer
This paper reports on a feasibility study into the evolution of robot controllers during the actual operation of robots (on-line), using only the computational resources within the...
373
Voted
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
A novel approach for event summarization and rare event detection is proposed. Unlike conventional methods that deal with event summarization and rare event detection independently...
128
click to vote
CATS
2008
15 years 2 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
83
Voted
AUSAI
2005
Springer
15 years 6 months ago
2005
Springer
In this work, we develop a multi-exchange heuristic based on an estimation improvement graph embedded in a simulated annealing to solve a problem arising in plant location planning...