526 search results - page 42 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
BMCBI
2005
14 years 9 months ago
2005
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
WINE
2009
Springer
15 years 4 months ago
2009
Springer
We study the problem of designing prediction markets for random variables with continuous or countably infinite outcomes on the real line. Our interval betting languages allow tra...
104
click to vote
JAIR
2010
14 years 8 months ago
2010
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
ICCAD
1999
IEEE
15 years 2 months ago
1999
IEEE
: In this paper, an algorithm for simultaneous logic restructuring and placement is presented. This algorithm first constructs a set of super-cells along the critical paths and the...
SIGSOFT
2002
ACM
15 years 10 months ago
2002
ACM
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...