Sciweavers

1546 search results - page 128 / 310
» Thoughts on solution concepts
Sort
View
IPPS
2008
IEEE
14 years 3 months ago
LiteLoad: Content unaware routing for localizing P2P protocols
In today’s extensive worldwide Internet traffic, some 60% of network congestion is caused by Peer to Peer sessions. Consequently ISPs are facing many challenges like: paying fo...
Shay Horovitz, Danny Dolev
ATAL
2010
Springer
13 years 10 months ago
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, ...
ICCAD
2009
IEEE
106views Hardware» more  ICCAD 2009»
13 years 7 months ago
An efficient pre-assignment routing algorithm for flip-chip designs
The flip-chip package is introduced for modern IC designs with higher integration density and larger I/O counts. In this paper, we consider the pre-assignment flip-chip routing pr...
Po-Wei Lee, Chung-Wei Lin, Yao-Wen Chang, Chin-Fan...
PODS
2011
ACM
201views Database» more  PODS 2011»
13 years 1 days ago
Data exchange beyond complete data
In the traditional data exchange setting, source instances are restricted to be complete in the sense that every fact is either true or false in these instances. Although natural ...
Marcelo Arenas, Jorge Pérez, Juan L. Reutte...
ICIP
2004
IEEE
14 years 10 months ago
Corridor scissors: a semi-automatic segmentation tool employing minimum-cost circular paths
We present a new semi-automatic segmentation tool, which is motivated by the Intelligent Scissors algorithm [1], but which uses a modified concept of user-interaction. This new in...
Dirk Farin, Magnus Pfeffer, Peter H. N. de With, W...