2031 search results - page 264 / 407 » Approximation Algorithms for 2-Stage Stochastic Optimization... |
GECCO
2009
Springer
14 years 27 days ago
2009
Springer
This paper addresses the problem of multiagent task allocation in extreme teams. An extreme team is composed by a large number of agents with overlapping functionality operating i...
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract— A distributed online learning framework for support vector machines (SVMs) is presented and analyzed. First, the generic binary classification problem is decomposed in...
IANDC
2006
13 years 8 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
This paper presents scheduling algorithms for procrastinators, where the speed that a procrastinator executes a job increases as the due date approaches. We give optimal off-line ...
SPAA
1999
ACM
14 years 17 days ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...