Sciweavers

9572 search results - page 46 / 1915
» Cover Algorithms and Their Combination
Sort
View
INFOCOM
2010
IEEE
13 years 8 months ago
Resilient Routing for Sensor Networks Using Hyperbolic Embedding of Universal Covering Space
—We study how to characterize the families of paths between any two nodes s, t in a sensor network with holes. Two paths that can be deformed to one another through local changes...
Wei Zeng, Rik Sarkar, Feng Luo 0002, Xianfeng Gu, ...
IPPS
1998
IEEE
14 years 2 months ago
PACE: Processor Architectures for Circuit Emulation
We describe a family of reconfigurable parallel architectures for logic emulation. They are supposed to be applicable like conventional FPGAs, while covering a larger range of circ...
Reiner Kolla, Oliver Springauf
FUN
2007
Springer
80views Algorithms» more  FUN 2007»
14 years 1 months ago
The Traveling Beams Optical Solutions for Bounded NP-Complete Problems
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
Shlomi Dolev, Hen Fitoussi
ECP
1999
Springer
138views Robotics» more  ECP 1999»
14 years 2 months ago
Numeric State Variables in Constraint-Based Planning
We extend a planning algorithm to cover simple forms of arithmetics. The operator preconditions can refer to the values of numeric variables and the operator postconditions can mod...
Jussi Rintanen, Hartmut Jungholt
CSB
2003
IEEE
14 years 3 months ago
An SVM-based Algorithm for Identification of Photosynthesis-specific Genome Features
This paper presents a novel algorithm for identification and functional characterization of “key” genome features responsible for a particular biochemical process of interest....
Gong-Xin Yu, George Ostrouchov, Al Geist, Nagiza F...