Sciweavers

28 search results - page 6 / 6
» The Structure and Complexity of Sports Elimination Numbers
Sort
View
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
13 years 11 months ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
CAISE
2003
Springer
13 years 10 months ago
Introducing Custom Language Extensions to SQL: 1999
Abstract. Even though SQL has become widely accepted as a language for implementing relational database schemas and querying data, there are cases where s experience the need for n...
Jernej Kovse, Wolfgang Mahnke
IJIT
2004
13 years 6 months ago
Modeling of Pulping of Sugar Maple Using Advanced Neural Network Learning
This paper reports work done to improve the modeling of complex processes when only small experimental data sets are available. Neural networks are used to capture the nonlinear un...
W. D. Wan Rosli, Z. Zainuddin, R. Lanouette, S. Sa...