Sciweavers

2899 search results - page 79 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
ICMCS
2005
IEEE
82views Multimedia» more  ICMCS 2005»
15 years 7 months ago
Globally Optimal Uneven Erasure-Protected Multi-Group Packetization of Scalable Codes
We study the problem of rate-distortion optimal packetization with uneven erasure protection (UEP) of scalable source sequence, into multiple groups of packets. The grouping of pa...
Sorina Dumitrescu, Xiaolin Wu
IJCAI
1989
15 years 2 months ago
Domain Dependence in Parallel Constraint Satisfaction
We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the ...
Paul R. Cooper, Michael J. Swain
DCC
2004
IEEE
15 years 5 months ago
Model Based Optimal Bit Allocation
Modeling of the operational rate-distortion characteristics of a signal can significantly reduce the computational complexity of an optimal bit allocation algorithm. In this repor...
Nasir Rajpoot
101
Voted
BIRTHDAY
2003
Springer
15 years 6 months ago
On the Pagination of Complex Documents
The pagination problem of complex documents is in placing text and floating objects on pages in such a way that each object appears close to, but not before, its text reference. ...
Anne Brüggemann-Klein, Rolf Klein, Stefan Woh...
ATMOS
2010
183views Optimization» more  ATMOS 2010»
15 years 12 days ago
The Complexity of Integrating Routing Decisions in Public Transportation Models
To model and solve optimization problems arising in public transportation, data about the passengers is necessary and has to be included in the models in any phase of the planning...
Marie Schmidt, Anita Schöbel