Sciweavers

6740 search results - page 123 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
CEC
2009
IEEE
14 years 2 months ago
Optimising efficiency and gain of small meander line RFID antennas using ant colony system
Radio Frequency IDentification (RFID) technology is increasingly being used to uniquely identify objects. An important component of RFID systems is the design of the antenna - whic...
Andrew Lewis, Gerhard Weiß, Marcus Randall, ...
ICSE
2009
IEEE-ACM
13 years 8 months ago
Increasing usability of preprocessing for feature management in product lines with queries
Managing features that have fine-grained impact on base programs is a challenging task in software product line development. Despite well-known problems, preprocessing (e.g., cpp)...
Stan Jarzabek, Hongyu Zhang, Youpeng Lee, Yinxing ...
FOCS
1999
IEEE
14 years 2 months ago
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
Jon Feldman, Matthias Ruhl
STACS
2010
Springer
14 years 5 months ago
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...
Bireswar Das, Jacobo Torán, Fabian Wagner
FSTTCS
2007
Springer
14 years 4 months ago
"Rent-or-Buy" Scheduling and Cost Coloring Problems
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
Takuro Fukunaga, Magnús M. Halldórss...