2446 search results - page 143 / 490 » Choiceless Polynomial Time |
115
click to vote
WADS
2005
Springer
15 years 6 months ago
2005
Springer
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for ...
94
Voted
CPM
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. This paper addresses the problem of aligning multiple sequences of non-coding RNA genes. We approach this problem with the biologically motivated paradigm that scoring of...
113
click to vote
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
ICALP
2004
Springer
15 years 6 months ago
2004
Springer
The analysis of security protocols requires precise formulations of the knowledge of protocol participants and attackers. In formal approaches, this knowledge is often treated in t...
129
click to vote
ICGI
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. A base problem in Web information extraction is to find appropriate queries for informative nodes in trees. We propose to learn queries for nodes in trees automatically ...