517 search results - page 89 / 104 » Approximation Algorithms for Scheduling with Reservations |
132
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
SIGECOM
2009
ACM
15 years 4 months ago
2009
ACM
The monopolist’s theory of optimal single-item auctions for agents with independent private values can be summarized by two statements. The first is from Myerson [8]: the optim...
GRAPHICSINTERFACE
2000
14 years 11 months ago
2000
Character animation is usually reserved for highly skilled animators and computer programmers because few of the available tools allow the novice or casual user to create compelli...
EAAI
2008
14 years 10 months ago
2008
This paper presents the design of an infinite horizon nonlinear optimal neurocontroller that replaces the conventional automatic voltage regulator and the turbine governor (CONVC)...
CAD
2006
Springer
14 years 10 months ago
2006
Springer
N-sided hole filling plays an important role in vertex blending. To deal with the case that the corner is surrounded by rational surfaces (i.e. NURBS surfaces), an algorithm to fi...