Sciweavers

840 search results - page 165 / 168
» Inapproximability of Combinatorial Optimization Problems
Sort
View
CDC
2009
IEEE
155views Control Systems» more  CDC 2009»
14 years 1 months ago
Efficient and robust communication topologies for distributed decision making in networked systems
Distributed decision making in networked systems depends critically on the timely availability of critical fresh information. Performance of networked systems, from the perspective...
John S. Baras, Pedram Hovareshti
WIOPT
2010
IEEE
13 years 8 months ago
Resource allocation for cross-layer utility maximization in multi-hop wireless networks in the presence of self interference
Abstract—The cross-layer utility maximization problem subject to stability constraints is considered for a multi-hop wireless network. A time slotted network, where the channel g...
Chathuranga Weeraddana, Marian Codreanu, Matti Lat...
ISBI
2008
IEEE
14 years 10 months ago
Chromosome pairing for karyotyping purposes using mutual information
Cytogenetics is the preferred tool in the diagnosis of genetic diseases such as leukemia and detection of aquired chromosomal abnormalities, such as translocations, deletions, mon...
Artem Khmelinskii, João Sanches, Rodrigo Ve...
KBSE
1998
IEEE
14 years 2 months ago
Automated Software Test Data Generation for Complex Programs
We report on GADGET, a new software test generation system that uses combinatorial optimization to obtain condition/decision coverage of C/C++ programs. The GADGET system is fully...
Christoph C. Michael, Gary McGraw
IPPS
1997
IEEE
14 years 2 months ago
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
Yuji Shinano, Kenichi Harada, Ryuichi Hirabayashi