Sciweavers

2435 search results - page 440 / 487
» Question Answering in Webclopedia
Sort
View
APN
2005
Springer
14 years 12 months ago
Timed-Arc Petri Nets vs. Networks of Timed Automata
Abstract. We establish mutual translations between the classes of 1safe timed-arc Petri nets (and its extension with testing arcs) and networks of timed automata (and its subclass ...
Jirí Srba
COCO
2008
Springer
88views Algorithms» more  COCO 2008»
14 years 11 months ago
Approximation of Natural W[P]-Complete Minimisation Problems Is Hard
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
Kord Eickmeyer, Martin Grohe, Magdalena Grübe...
COLT
2008
Springer
14 years 11 months ago
On the Power of Membership Queries in Agnostic Learning
We study the properties of the agnostic learning framework of Haussler [Hau92] and Kearns, Schapire and Sellie [KSS94]. In particular, we address the question: is there any situat...
Vitaly Feldman
ICADL
2007
Springer
112views Education» more  ICADL 2007»
14 years 11 months ago
Humanities Graduate Students' Use Behavior on Full-Text Databases for Ancient Chinese Books
Digitizing ancient books, especially those related to the humanities, is practiced in many countries. The number of full-text databases in the humanities is increasing. Studies hav...
Ming-der Wu, Shih-chuan Chen
ECAI
2008
Springer
14 years 11 months ago
Combining Domain-Independent Planning and HTN Planning: The Duet Planner
Abstract. Despite the recent advances in planning for classical domains, the question of how to use domain knowledge in planning is yet to be completely and clearly answered. Some ...
Alfonso Gerevini, Ugur Kuter, Dana S. Nau, Alessan...