3008 search results - page 523 / 602 » Independence in connected graphs |
213
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
168
click to vote
ICRA
2002
IEEE
15 years 11 months ago
2002
IEEE
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
143
click to vote
ESWS
2010
Springer
15 years 11 months ago
2010
Springer
This paper presents an approach for the interactive discovery of relationships between selected elements via the Semantic Web. It emphasizes the human aspect of relationship discov...
189
click to vote
LION
2010
Springer
15 years 11 months ago
2010
Springer
Abstract This paper proposes a flexible software architecture for interactive multiobjective optimization, with a user interface for visualizing the results and facilitating the s...
165
click to vote
DNA
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. The goal of this research is to improve the programmability of DNA-based computers. Novel clockable microreactors can be connected in various ways to solve combinatorial ...