3663 search results - page 93 / 733 » Problems in the ontology of computer programs |
COR
2006
14 years 10 months ago
2006
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
COR
2008
14 years 10 months ago
2008
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
100
click to vote
ICCV
1998
IEEE
15 years 2 months ago
1998
IEEE
This paper describes a new algorithm for solving the N-camera stereo correspondence problem by transforming it into a maximum- ow problem. Once solved, the minimum-cut associated ...
DNA
2009
Springer
15 years 4 months ago
2009
Springer
Knowledge of energy barriers between pairs of secondary structures for a given DNA or RNA molecule is useful, both in understanding RNA function in biological settings and in desig...