Sciweavers

7978 search results - page 465 / 1596
» Combining shared-coin algorithms
Sort
View
IANDC
2006
86views more  IANDC 2006»
15 years 6 months ago
Table design in dynamic programming
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
Peter Steffen, Robert Giegerich
COR
2007
112views more  COR 2007»
15 years 6 months ago
The bi-objective covering tour problem
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
Nicolas Jozefowiez, Frédéric Semet, ...
IJSYSC
2006
63views more  IJSYSC 2006»
15 years 6 months ago
Experimental demonstration of coordinated control for multi-vehicle teams
: This paper introduces two unique testbeds that have recently been developed at MIT to demonstrate coordination and control algorithms for teams of autonomous UAVs. The first test...
Ellis King, Yoshiaki Kuwata, Jonathan P. How
207
Voted
JMLR
2006
107views more  JMLR 2006»
15 years 6 months ago
Consistency of Multiclass Empirical Risk Minimization Methods Based on Convex Loss
The consistency of classification algorithm plays a central role in statistical learning theory. A consistent algorithm guarantees us that taking more samples essentially suffices...
Di-Rong Chen, Tao Sun
JSAC
2006
79views more  JSAC 2006»
15 years 6 months ago
Layered Multicast Rate Control Based on Lagrangian Relaxation and Dynamic Programming
In this paper, we address the rate control problem for layered multicast traffic, with the objective of solving a generalized throughput/fairness objective. Our approach is based o...
Koushik Kar, Leandros Tassiulas