Sciweavers

14165 search results - page 657 / 2833
» The generalized two-server problem
Sort
View
HEURISTICS
2006
109views more  HEURISTICS 2006»
15 years 7 months ago
A scatter search algorithm for project scheduling under partially renewable resources
In this paper we develop a heuristic algorithm, based on Scatter Search, for project scheduling problems under partially renewable resources. This new type of resource can be view...
Ramón Alvarez-Valdés, Enric Crespo, ...
CORR
2007
Springer
57views Education» more  CORR 2007»
15 years 7 months ago
On Evaluating the Rate-Distortion Function of Sources with Feed-Forward and the Capacity of Channels with Feedback
— In this work, we study the problem of evaluating the performance limit of two communication problems that are closely related to each other- source coding with feed-forward and...
Ramji Venkataramanan, S. Sandeep Pradhan
CORR
2007
Springer
119views Education» more  CORR 2007»
15 years 7 months ago
Hadwiger and Helly-type theorems for disjoint unit spheres
Let S be an ordered set of disjoint unit spheres in R3 . We show that if every subset of at most six spheres from S admits a line transversal respecting the ordering, then the ent...
Otfried Cheong, Xavier Goaoc, Andreas Holmsen, Syl...
JCP
2008
97views more  JCP 2008»
15 years 7 months ago
Vocal Tract Area Function Estimation Using Particle Swarm
-- The problem of estimating the Vocal Tract Area Functions (VTAF) from speech signals arise in many applications. However, the existing methods for solving this problem were desig...
Mahmoud A. Ismail
IPL
2006
69views more  IPL 2006»
15 years 7 months ago
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
André Große, Jörg Rothe, Gerd We...