526 search results - page 29 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
106
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of co...
157
Voted
ALGORITHMICA
2002
15 years 3 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
114
Voted
IROS
2009
IEEE
15 years 10 months ago
2009
IEEE
—This study attempts to make a compact humanoid robot acquire a giant-swing motion without any robotic models by using reinforcement learning; only the interaction with environme...
139
Voted
HEURISTICS
2008
15 years 3 months ago
2008
In this article we investigate a new variant of Variable Neighborhood Search (VNS): Relaxation Guided Variable Neighborhood Search. It is based on the general VNS scheme and a new...
146
Voted
SSS
2007
Springer
15 years 10 months ago
2007
Springer
We consider Cooperative Intrusion Detection System (CIDS) which is a distributed AIS-based (Artificial Immune System) IDS where nodes collaborate over a peer-to-peer overlay netwo...