Sciweavers

117 search results - page 15 / 24
» Hybrid constructive heuristics for the critical node problem
Sort
View
FPL
2006
Springer
96views Hardware» more  FPL 2006»
15 years 2 months ago
Reducing the Space Complexity of Pipelined Routing Using Modified Range Encoding
Interconnect delays are becoming an increasingly significant part of the critical path delay for circuits implemented in FPGAs. Pipelined interconnects have been proposed to addre...
Allan Carroll, Carl Ebeling
ICCV
1999
IEEE
16 years 10 days ago
Unsupervised Image Classification with a Hierarchical EM Algorithm
This work takes place in the context of hierarchical stochastic models for the resolution of discrete inverse problems from low level vision. Some of these models lie on the nodes...
Annabelle Chardin, Patrick Pérez
GECCO
2004
Springer
118views Optimization» more  GECCO 2004»
15 years 3 months ago
Adapting Representation in Genetic Programming
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees....
Cezary Z. Janikow
MFCS
2005
Springer
15 years 3 months ago
Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix
Abstract. Given a distance matrix M that specifies the pairwise evolutionary distances between n species, the phylogenetic tree reconstruction problem asks for an edge-weighted ph...
Ho-Leung Chan, Jesper Jansson, Tak Wah Lam, Siu-Mi...
MOBIHOC
2002
ACM
15 years 10 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder