Sciweavers

6894 search results - page 368 / 1379
» Generation Problems
Sort
View
ACL
2009
15 years 4 months ago
A Polynomial-Time Parsing Algorithm for TT-MCTAG
This paper investigates the class of TreeTuple MCTAG with Shared Nodes, TTMCTAG for short, an extension of Tree Adjoining Grammars that has been proposed for natural language proc...
Laura Kallmeyer, Giorgio Satta
167
Voted
CDC
2010
IEEE
169views Control Systems» more  CDC 2010»
15 years 1 months ago
Control of a bicycle using virtual holonomic constraints
The problem of making a bicycle trace a strictly convex Jordan curve with bounded roll angle and bounded speed is investigated. The problem is solved by enforcing a virtual holonom...
Luca Consolini, Manfredi Maggiore
SPIRE
2009
Springer
15 years 11 months ago
Faster Algorithms for Sampling and Counting Biological Sequences
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
Christina Boucher
AEI
2008
108views more  AEI 2008»
15 years 7 months ago
Combinatorial synthesis approach employing graph networks
The paper proposes a methodology to assist the designer at the initial stages of the design synthesis process by enabling him/her to employ knowledge and algorithms existing in gr...
Offer Shai, Noel Titus, Karthik Ramani
CORR
2010
Springer
69views Education» more  CORR 2010»
15 years 6 months ago
Efficient Knowledge Base Management in DCSP
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...
Hong Jiang