Sciweavers

2738 search results - page 13 / 548
» The Frobenius Problem and Its Generalizations
Sort
View
SIAMCOMP
2008
132views more  SIAMCOMP 2008»
13 years 7 months ago
An APTAS for Generalized Cost Variable-Sized Bin Packing
Bin packing is a well known problem which has a large number of applications. Classical bin packing is a simple model where all bins are identical. In the bin packing problem with...
Leah Epstein, Asaf Levin
CORR
2011
Springer
147views Education» more  CORR 2011»
13 years 2 months ago
Human-Assisted Graph Search: It's Okay to Ask Questions
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...
Aditya G. Parameswaran, Anish Das Sarma, Hector Ga...
STOC
2007
ACM
164views Algorithms» more  STOC 2007»
14 years 8 months ago
All-pairs bottleneck paths for general graphs in truly sub-cubic time
In the all-pairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real non-negative capacities on its edges and is aske...
Virginia Vassilevska, Ryan Williams, Raphael Yuste...
ADHOCNOW
2004
Springer
14 years 1 months ago
Range-Free Ranking in Sensors Networks and Its Applications to Localization
We address the question of finding sensors’ coordinates, or at least an approximation of them, when the sensors’ abilities are very weak. In a d dimensional space, we define ...
Zvi Lotker, Marc Martinez de Albeniz, Stephane Per...
AIEDU
2005
68views more  AIEDU 2005»
13 years 7 months ago
Software Patterns in ITS Architectures
The paper discusses ITS architectures in terms of patterns that exist within them. The concept of patterns has received surprisingly little attention so far from researchers in the...
Vladan Devedzic, Andreas Harrer