Sciweavers

4666 search results - page 749 / 934
» Equations on Timed Languages
Sort
View
JAIR
2006
90views more  JAIR 2006»
15 years 4 months ago
Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...
Jörg Hoffmann, Stefan Edelkamp, Sylvie Thi&ea...
SIGCSE
2008
ACM
166views Education» more  SIGCSE 2008»
15 years 4 months ago
Defense against the dark arts
Computer science faculty must attract and retain students by offering innovative courses that spark student interest, yet still teach core, computer science concepts. These effort...
Mark W. Bailey, Clark L. Coleman, Jack W. Davidson
COMPUTER
2000
180views more  COMPUTER 2000»
15 years 4 months ago
The Challenges of Automatic Summarization
tion--the art of abstracting key content from one or more information sources--has become an integral part of everyday life. People keep abreast of world affairs by listening to ne...
Udo Hahn, Inderjeet Mani
JOCN
2011
94views more  JOCN 2011»
14 years 11 months ago
ERP Correlates of Word Production before and after Stroke in an Aphasic Patient
■ Changes in brain activity characterizing impaired speech production after brain damage have usually been investigated by comparing aphasic speakers with healthy subjects becau...
Marina Laganaro, Stéphanie Morand, Christop...
ICALP
2011
Springer
14 years 7 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli