Sciweavers

1404 search results - page 216 / 281
» Optimization problems in multiple-interval graphs
Sort
View
JETAI
2008
93views more  JETAI 2008»
14 years 9 months ago
The message management asynchronous backtracking algorithm
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...
Hong Jiang, José M. Vidal
SIGMOD
2009
ACM
182views Database» more  SIGMOD 2009»
15 years 10 months ago
3-HOP: a high-compression indexing scheme for reachability query
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
15 years 7 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
ISCC
2008
IEEE
15 years 4 months ago
Scheduling high-rate sessions in Fractional Lambda Switching networks: Algorithm and analysis
This work addresses the high-rate session scheduling problem in Fractional Lambda Switching (FλS) networks. With its global phase synchronization and pipeline forwarding (PF) ope...
Thu-Huong Truong, Mario Baldi, Yoram Ofek
MOBIWAC
2006
ACM
15 years 3 months ago
Quick convergecast in ZigBee/IEEE 802.15.4 tree-based wireless sensor networks
Convergecast is a fundamental operation in wireless sensor networks. Existing convergecast solutions have focused on reducing latency and energy consumption. However, a good desig...
Yu-Chee Tseng, Meng-Shiuan Pan