Sciweavers

1127 search results - page 185 / 226
» New Algorithms for Generalized Network Flows
Sort
View
AAAI
2008
15 years 11 days ago
Anytime Local Search for Distributed Constraint Optimization
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small prob...
Roie Zivan
RECSYS
2009
ACM
15 years 4 months ago
Ordering innovators and laggards for product categorization and recommendation
Different buyers exhibit different purchasing behaviors. Some rush to purchase new products while others tend to be more cautious, waiting for reviews from people they trust. In...
Sarah K. Tyler, Shenghuo Zhu, Yun Chi, Yi Zhang
DSN
2007
IEEE
15 years 4 months ago
Electing an Eventual Leader in an Asynchronous Shared Memory System
This paper considers the problem of electing an eventual leader in an asynchronous shared memory system. While this problem has received a lot of attention in messagepassing syste...
Antonio Fernández, Ernesto Jiménez, ...
ICDCS
1999
IEEE
15 years 2 months ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta
MOBICOM
2012
ACM
13 years 15 days ago
Faster GPS via the sparse fourier transform
GPS is one of the most widely used wireless systems. A GPS receiver has to lock on the satellite signals to calculate its position. The process of locking on the satellites is qui...
Haitham Hassanieh, Fadel Adib, Dina Katabi, Piotr ...