Sciweavers

1054 search results - page 180 / 211
» Capacitated Domination Problem
Sort
View
72
Voted
ECCC
2007
122views more  ECCC 2007»
14 years 11 months ago
Infeasibility of Instance Compression and Succinct PCPs for NP
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
Lance Fortnow, Rahul Santhanam
TEC
2002
161views more  TEC 2002»
14 years 10 months ago
A fast and elitist multiobjective genetic algorithm: NSGA-II
Multiobjective evolutionary algorithms (EAs) that use nondominated sorting and sharing have been criticized mainly for their: 1) ( 3) computational complexity (where is the number ...
Kalyanmoy Deb, Samir Agrawal, Amrit Pratap, T. Mey...
TMC
2012
13 years 1 months ago
Elevator-Assisted Sensor Data Collection for Structural Health Monitoring
—Sensor networks nowadays are widely used for structural health monitoring; for example, the sensor monitoring system deployed on the Guangzhou New TV Tower, China. While wired s...
Tao Zhang, Dan Wang, Jiannong Cao, Yi Qing Ni, Lij...
STACS
2010
Springer
15 years 6 months ago
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
VLSID
2004
IEEE
170views VLSI» more  VLSID 2004»
15 years 11 months ago
On-chip networks: A scalable, communication-centric embedded system design paradigm
As chip complexity grows, design productivity boost is expected from reuse of large parts and blocks of previous designs with the design effort largely invested into the new parts...
Jörg Henkel, Srimat T. Chakradhar, Wayne Wolf