Sciweavers

1998 search results - page 297 / 400
» Complexity of the Cover Polynomial
Sort
View
95
Voted
KYOTODL
2000
87views more  KYOTODL 2000»
15 years 2 months ago
Modeling Customizable Web Applications
The web is more and more used as a platform for fullfledged, increasingly complex applications, where a huge amount of change-intensive data is managed by underlying database syst...
Gerti Kappel, Werner Retschitzegger, Wieland Schwi...
117
Voted
AAAI
1996
15 years 2 months ago
Design and Implementation of a Replay Framework Based on a Partial Order Planner
In this paper we describe the design and implementation of the derivation replay framework, dersnlp+ebl (Derivational snlp+ebl), which is based within a partial order planner. der...
Laurie H. Ihrig, Subbarao Kambhampati
104
Voted
NAACL
1994
15 years 2 months ago
Multilingual Speech Databases at LDC
As multilingual products and technology grow in importance, the Linguistic Data Consortium (LDC) intends to provide the resources needed for research and development activities, e...
John J. Godfrey
94
Voted
CCCG
2009
15 years 1 months ago
Enumeration of Polyominoes for p4 Tiling
Polyominoes are the two dimensional shapes made by connecting n unit squares, joined along their edges. In this paper, we propose algorithms to enumerate polyominoes for p4 tiling...
Takashi Horiyama, Masato Samejima
ECAI
2010
Springer
15 years 1 months ago
On Testing Answer-Set Programs
Answer-set programming (ASP) is a well-acknowledged paradigm for declarative problem solving, yet comparably little effort has been spent on the investigation of methods to support...
Tomi Janhunen, Ilkka Niemelä, Johannes Oetsch...