Sciweavers

1494 search results - page 187 / 299
» Less Extreme Programming
Sort
View
124
Voted
AAAI
2008
15 years 5 months ago
Interaction Structure and Dimensionality Reduction in Decentralized MDPs
Decentralized Markov Decision Processes are a powerful general model of decentralized, cooperative multi-agent problem solving. The high complexity of the general problem leads to...
Martin Allen, Marek Petrik, Shlomo Zilberstein
114
Voted
COLING
1994
15 years 4 months ago
Two Parsing Algorithms by Means of Finite State Transducers
We present a new apl)roach , ilhlstrated by two algorithms> for parsing not only Finite SI.ate (:Iranlnlars but also Context Free Grainlnars and their extension, by means of fi...
Emmanuel Roche
152
Voted
ACL
1990
15 years 3 months ago
Automatically Extracting and Representing Collocations for Language Generation
Collocational knowledge is necessary for language generation. The problem is that collocations come in a large variety of forms. They can involve two, three or more words, these w...
Frank A. Smadja, Kathleen McKeown
105
Voted
CORR
2010
Springer
81views Education» more  CORR 2010»
15 years 2 months ago
Using machine learning to make constraint solver implementation decisions
Programs to solve so-called constraint problems are complex pieces of software which require many design decisions to be made more or less arbitrarily by the implementer. These dec...
Lars Kotthoff, Ian P. Gent, Ian Miguel
113
Voted
ECEASST
2008
77views more  ECEASST 2008»
15 years 2 months ago
Using OCL in Executable UML
Executable UML allows precisely describing the software system at level of abstraction. The executable models can be translated to a less programming language completely or execute...
Ke Jiang, Lei Zhang, Shigeru Miyake