1816 search results - page 39 / 364 » A New Approach for Solving the Maximum Clique Problem |
105
click to vote
CCE
2004
14 years 11 months ago
2004
Optimal control problems involve the difficult task of determining time-varying profiles through dynamic optimization. Such problems become even more complex in practical situatio...
AAAI
2008
15 years 2 months ago
2008
Recent research has shown the benefit of framing problems of imitation learning as solutions to Markov Decision Problems. This approach reduces learning to the problem of recoveri...
RECOMB
2004
Springer
16 years 4 days ago
2004
Springer
We present a new algorithm for the problems of genotype phasing and block partitioning. Our algorithm is based on a new stochastic model, and on the novel concept of probabilistic...
DATE
2008
IEEE
15 years 1 months ago
2008
IEEE
Many decision and optimization problems in Electronic Design Automation (EDA) can be solved with Boolean Satisfiability (SAT). Moreover, well-known extensions of SAT also find app...
95
Voted
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...