Sciweavers

811 search results - page 11 / 163
» An efficient algorithm for the configuration problem of domi...
Sort
View
MFCS
2004
Springer
14 years 29 days ago
The Bidimensional Theory of Bounded-Genus Graphs
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitr...
HASE
2007
IEEE
13 years 11 months ago
An Efficient Experimental Methodology for Configuring Search-Based Design Algorithms
Many problems in high assurance systems design are only tractable using computationally expensive search algorithms. For these algorithms to be useful, designers must be provided ...
Simon M. Poulding, Paul Emberson, Iain Bate, John ...
ICMCS
2007
IEEE
138views Multimedia» more  ICMCS 2007»
14 years 1 months ago
A Compact and Efficient Color Descriptor for Image Retrieval
— An important problem in color based image retrieval is the lack of efficient way to represent both the color and the spatial structure information with single descriptor. To so...
Ka-Man Wong, Lai-Man Po, Kwok-Wai Cheung
JSW
2008
136views more  JSW 2008»
13 years 7 months ago
Collaborative Product Configuration: Formalization and Efficient Algorithms for Dependency Analysis
- In the Software Product Line approach, product configuration is a key activity in which stakeholders choose features for a product. This activity is critical in the sense that ca...
Marcílio Mendonça, Donald D. Cowan, ...
APWEB
2006
Springer
13 years 11 months ago
Strongly Connected Dominating Sets in Wireless Sensor Networks with Unidirectional Links
A Connected Dominating Set (CDS) can serve as a virtual backbone for a wireless sensor network since there is no fixed infrastructure or centralized management in wireless sensor n...
Ding-Zhu Du, My T. Thai, Yingshu Li, Dan Liu, Shiw...