Sciweavers

5889 search results - page 1006 / 1178
» Graph Layout Problems
Sort
View
CP
2007
Springer
15 years 6 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
DIS
2009
Springer
15 years 6 months ago
Discovering Influential Nodes for SIS Models in Social Networks
We address the problem of efficiently discovering the influential nodes in a social network under the susceptible/infected/susceptible (SIS) model, a diffusion model where nodes ar...
Kazumi Saito, Masahiro Kimura, Hiroshi Motoda
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 6 months ago
A new crossover technique for Cartesian genetic programming
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
Janet Clegg, James Alfred Walker, Julian Francis M...
ICCCN
2007
IEEE
15 years 6 months ago
Exploring Load-Balance to Dispatch Mobile Sensors in Wireless Sensor Networks
In this paper, a hybrid sensor network consisting of static and mobile sensors is considered, where static sensors are used to detect events, and mobile sensors can move to event l...
You-Chiun Wang, Wen-Chih Peng, Min-Hsien Chang, Yu...
ATVA
2004
Springer
138views Hardware» more  ATVA 2004»
15 years 6 months ago
Providing Automated Verification in HOL Using MDGs
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
Tarek Mhamdi, Sofiène Tahar
« Prev « First page 1006 / 1178 Last » Next »