Sciweavers

1200 search results - page 23 / 240
» Marked Ancestor Problems
Sort
View
TSE
2011
111views more  TSE 2011»
13 years 4 months ago
Software Module Clustering as a Multi-Objective Search Problem
Software module clustering is the problem of automatically organising software units into modules to improve program structure. There has been a great deal of recent interest in s...
Kata Praditwong, Mark Harman, Xin Yao
ICALP
2003
Springer
14 years 3 months ago
Solving the Robots Gathering Problem
Abstract. Consider a set of n > 2 simple autonomous mobile robots (decentralized, asynchronous, no common coordinate system, no identities, no central coordination, no direct co...
Mark Cieliebak, Paola Flocchini, Giuseppe Prencipe...
DAM
2006
191views more  DAM 2006»
13 years 10 months ago
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
J. Mark Keil, Lorna Stewart
CORR
2007
Springer
76views Education» more  CORR 2007»
13 years 9 months ago
A Light-Based Device for Solving the Hamiltonian Path Problem
In this paper we suggest the use of light for performing useful computations. Namely, we propose a special device which uses light rays for solving the Hamiltonian path problem on ...
Mihai Oltean
CORR
2007
Springer
93views Education» more  CORR 2007»
13 years 9 months ago
Solving the Hamiltonian path problem with a light-based computer
Abstract. In this paper we suggest the use of light for performing useful computations. Namely, we propose a special computational device which uses light rays for solving the Hami...
Mihai Oltean