Sciweavers

736 search results - page 110 / 148
» Confidence-Aware Join Algorithms
Sort
View
RECOMB
2009
Springer
14 years 4 months ago
Counting All DCJ Sorting Scenarios
In genome rearrangements, the double cut and join (DCJ) operation, introduced by Yancopoulos et al., allows to represent most rearrangement events that could happen in multichromos...
Marília D. V. Braga, Jens Stoye
SASO
2008
IEEE
14 years 4 months ago
Self-Organized Synchronization in Wireless Network
We investigate periodic time synchronization of networks without centralized control, which can be modeled as a problem of aligning local variables taking values on a circle. Sync...
Jiang Yu, Olav Tirkkonen
FAW
2007
Springer
177views Algorithms» more  FAW 2007»
14 years 4 months ago
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
Hannes Moser, Somnath Sikdar
CP
2004
Springer
14 years 3 months ago
Counting-Based Look-Ahead Schemes for Constraint Satisfaction
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
Kalev Kask, Rina Dechter, Vibhav Gogate
NCA
2003
IEEE
14 years 3 months ago
Organizing a Distributed Application in a Mobile Ad Hoc Network
A distributed application that operates in an ad hoc network formed by mobile nodes must limit its use of all-to-all communication since the overall capacity of such a network is ...
Cristian Tuduce, Thomas R. Gross