2109 search results - page 165 / 422 » Solving Necklace Constraint Problems |
166
click to vote
FUIN
2010
15 years 4 months ago
2010
Given a set of taxa S and a complete set of quartet topologies Q over S, the problem of determining a phylogeny that satisfies the maximum number of topologies is called the Maxi...
160
click to vote
VLSID
2003
IEEE
16 years 6 months ago
2003
IEEE
In the previous work, the problem of nding gate delays to eliminate glitches has been solved by linear programs (LP) requiring an exponentially large number ofconstraints. By intr...
158
Voted
ICIDS
2009
Springer
16 years 25 days ago
2009
Springer
Abstract. AI planning has featured in a number of Interactive Storytelling prototypes: since narratives can be naturally modelled as a sequence of actions it has been possible to e...
134
click to vote
ASPDAC
2009
ACM
16 years 24 days ago
2009
ACM
— 1In this paper, we will present a placement method for analog circuits. We consider both common centroid and 1-D symmetry constraints, which are the two most common types of pl...
146
click to vote
AI
2007
Springer
16 years 14 days ago
2007
Springer
When using Bayesian networks, practitioners often express constraints among variables by conditioning a common child node to induce the desired distribution. For example, an ‘or...