Sciweavers

76 search results - page 10 / 16
» Parallel Depth First Proof Number Search
Sort
View
AAAI
2007
13 years 10 months ago
Dynamic DFS Tree in ADOPT-ing
Several distributed constraint reasoning algorithms employ Depth First Search (DFS) trees on the constraint graph that spans involved agents. In this article we show that it is po...
Marius-Calin Silaghi, Makoto Yokoo
INFOCOM
2010
IEEE
13 years 7 months ago
Toward the Practical Use of Network Tomography for Internet Topology Discovery
Abstract—Accurate and timely identification of the routerlevel topology of the Internet is one of the major unresolved problems in Internet research. Topology recovery via tomog...
Brian Eriksson, Gautam Dasarathy, Paul Barford, Ro...
PPOPP
2006
ACM
14 years 2 months ago
On-line automated performance diagnosis on thousands of processes
Performance analysis tools are critical for the effective use of large parallel computing resources, but existing tools have failed to address three problems that limit their scal...
Philip C. Roth, Barton P. Miller
HIPC
2007
Springer
14 years 9 days ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
DDECS
2007
IEEE
175views Hardware» more  DDECS 2007»
14 years 2 months ago
Analyzing Test and Repair Times for 2D Integrated Memory Built-in Test and Repair
—An efficient on-chip infrastructure for memory test and repair is crucial to enhance yield and availability of SoCs. A commonly used repair strategy is to equip memories with sp...
Philipp Öhler, Sybille Hellebrand, Hans-Joach...