805 search results - page 118 / 161 » Combinatorial optimization problems in self-assembly |
150
click to vote
FOCS
2005
IEEE
16 years 4 days ago
2005
IEEE
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a wide variety of r...
181
click to vote
SMC
2007
IEEE
16 years 24 days ago
2007
IEEE
—Reinforcement learning is a framework in which an agent can learn behavior without knowledge on a task or an environment by exploration and exploitation. Striking a balance betw...
190
click to vote
ALGORITHMICA
2002
15 years 6 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...
211
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
169
click to vote
GLOBECOM
2008
IEEE
2008
IEEE
Network Planning for Next-Generation Metropolitan-Area Broadband Access under EPON-WiMAX Integration
15 years 6 months ago
Abstract--This paper tackles a fundamental problem of network planning and dimensioning under EPON-WiMAX integration for next-generation wireless metropolitan-area broadband access...