248 search results - page 25 / 50 » Parameterized Algorithms for Directed Maximum Leaf Problems |
CP
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
100
click to vote
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— Target shape design optimization problem (TSDOP) is a miniature model for real world design optimization problems. It is proposed as a test bed to design and analyze op...
108
click to vote
ACL
2008
15 years 1 months ago
2008
In this work, the problem of extracting phrase translation is formulated as an information retrieval process implemented with a log-linear model aiming for a balanced precision an...
ALGORITHMICA
2002
14 years 11 months ago
2002
Given a directed acyclic graph with timing constraints, the budget management problem is to assigntoeachvertexanincrementaldelaysuchthatthesumofthesedelaysismaximizedwithoutviolati...
110
click to vote
WABI
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...