3653 search results - page 372 / 731 » On Recognizable Timed Languages |
186
click to vote
FLAIRS
2006
15 years 8 months ago
2006
For a long time categorial grammars were regarded as "toys grammars". Indeed, in spite of a very solid theoretical base, categorial grammars remain rather marginal as so...
189
click to vote
WSC
1998
15 years 8 months ago
1998
We apply a Reactive Tabu Search (RTS) heuristic within a discrete-event simulation to solve routing problems for Unmanned Aerial Vehicles (UAVs). Our formulation represents this p...
156
click to vote
AAAI
1993
15 years 8 months ago
1993
The Rete and Treat algorithms are considered the most efficient implementation techniques for Forward Chaining rule systems. These algorithms support a language of limited express...
172
click to vote
WOA
2007
15 years 8 months ago
2007
Abstract—In this work, we present a constrained-based representation for specifying the goals of “course design”, that we call curricula model, and introduce a graphical lang...
174
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language unders...