Sciweavers

18306 search results - page 40 / 3662
» Algorithmics in Exponential Time
Sort
View
NIPS
2008
13 years 11 months ago
Continuously-adaptive discretization for message-passing algorithms
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
Michael Isard, John MacCormick, Kannan Achan
TAPD
1998
81views more  TAPD 1998»
13 years 11 months ago
A Generalized CYK Algorithm for Parsing Stochastic CFG
We present a bottom-up parsing algorithm for stochastic context-free grammars that is able (1) to deal with multiple interpretations of sentences containing compoundwords; (2) to ...
Jean-Cédric Chappelier, Martin Rajman
CEC
2008
IEEE
14 years 4 months ago
Analysis of population-based evolutionary algorithms for the vertex cover problem
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...
Pietro Simone Oliveto, Jun He, Xin Yao
ASPDAC
2004
ACM
149views Hardware» more  ASPDAC 2004»
14 years 3 months ago
A coupling and crosstalk considered timing-driven global routing algorithm for high performance circuit design
With the exponential reduction in the scaling of feature size, inter-wire coupling capacitance becomes the dominant part of load capacitance. Two problems are introduced by coupli...
Jingyu Xu, Xianlong Hong, Tong Jing, Ling Zhang, J...
AICOM
2004
92views more  AICOM 2004»
13 years 10 months ago
An efficient consistency algorithm for the Temporal Constraint Satisfaction Problem
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
Berthe Y. Choueiry, Lin Xu