Sciweavers

2192 search results - page 190 / 439
» Algorithms for Challenging Motif Problems
Sort
View
ICCAD
2007
IEEE
153views Hardware» more  ICCAD 2007»
16 years 1 months ago
Checking equivalence of quantum circuits and states
Among the post-CMOS technologies currently under investigation, quantum computing (QC) holds a special place. QC offers not only extremely small size and low power, but also expon...
George F. Viamontes, Igor L. Markov, John P. Hayes
CPM
2009
Springer
127views Combinatorics» more  CPM 2009»
15 years 11 months ago
Deconstructing Intractability: A Case Study for Interval Constrained Coloring
The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer interv...
Christian Komusiewicz, Rolf Niedermeier, Johannes ...
128
Voted
ACSC
2007
IEEE
15 years 11 months ago
Mutually Visible Agents in a Discrete Environment
As computer controlled entities are set to move and explore more complex environments they need to be able to perform navigation tasks, like finding minimal cost routes. Much wor...
Joel Fenwick, Vladimir Estivill-Castro
SENSYS
2004
ACM
15 years 10 months ago
MNP: multihop network reprogramming service for sensor networks
Reprogramming of sensor networks is an important and challenging problem as it is often necessary to reprogram the sensors in place. In this paper, we propose a multihop reprogram...
Limin Wang
165
Voted
ICALP
2003
Springer
15 years 9 months ago
Quantitative Analysis of Probabilistic Lossy Channel Systems
Many protocols are designed to operate correctly even in the case where the underlying communication medium is faulty. To capture the behaviour of such protocols, lossy channel sy...
Alexander Moshe Rabinovich