Sciweavers

6455 search results - page 41 / 1291
» Research problems
Sort
View
DCC
2002
IEEE
14 years 8 months ago
Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
Alexander E. Mohr
DC
2010
13 years 9 months ago
The mailbox problem
d Abstract) Marcos K. Aguilera1 , Eli Gafni1,2 , and Leslie Lamport1 1 Microsoft Research Silicon Valley 2 UCLA We propose and solve a synchronization problem called the mailbox pr...
Marcos Kawazoe Aguilera, Eli Gafni, Leslie Lamport
MMS
1998
13 years 8 months ago
The Multimedia Multicasting Problem
This paper explores the problems associated with the multicasting of continuous media to support multimedia group applications. The interaction between multicasting and the deliver...
Joseph Pasquale, George C. Polyzos, George Xylomen...
JAIR
2006
131views more  JAIR 2006»
13 years 9 months ago
Asynchronous Partial Overlay: A New Algorithm for Solving Distributed Constraint Satisfaction Problems
Distributed Constraint Satisfaction (DCSP) has long been considered an important problem in multi-agent systems research. This is because many real-world problems can be represent...
Roger Mailler, Victor R. Lesser
ANOR
2005
72views more  ANOR 2005»
13 years 8 months ago
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem
: The vertex coloring problem has been the subject of extensive research for many years. Driven by application potential as well as computational challenge, a variety of methods ha...
Gary A. Kochenberger, Fred Glover, Bahram Alidaee,...