Sciweavers

1099 search results - page 147 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
ACL
1990
14 years 11 months ago
Structural Disambiguation with Constraint Propagation
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsin...
Hiroshi Maruyama
FSTTCS
2008
Springer
14 years 11 months ago
Explicit Muller Games are PTIME
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...
Florian Horn
ISCAS
2005
IEEE
159views Hardware» more  ISCAS 2005»
15 years 3 months ago
A Fourier series-based RLC interconnect model for periodic signals
— Based on a Fourier series analysis, an analytic interconnect model is presented which is suitable for periodic signals, such as a clock signal. In this model, the far end time ...
Guoqing Chen, Eby G. Friedman
DAC
2008
ACM
15 years 11 months ago
Concurrent topology and routing optimization in automotive network integration
In this paper, a novel automatic approach for the concurrent topology and routing optimization that achieves a high quality network layout is proposed. This optimization is based ...
Bardo Lang, Christian Haubelt, Jürgen Teich, ...
LAMAS
2005
Springer
15 years 3 months ago
An Overview of Cooperative and Competitive Multiagent Learning
Abstract Multi-agent systems (MASs) is an area of distributed artificial intelligence that emphasizes the joint behaviors of agents with some degree of autonomy and the complexiti...
Pieter Jan't Hoen, Karl Tuyls, Liviu Panait, Sean ...