Sciweavers

99 search results - page 16 / 20
» Stable normal forms for polynomial system solving
Sort
View
AAIP
2009
13 years 8 months ago
Incremental Learning in Inductive Programming
Inductive programming systems characteristically exhibit an exponential explosion in search time as one increases the size of the programs to be generated. As a way of overcoming ...
Robert Henderson
ATAL
2007
Springer
14 years 1 months ago
An equal excess negotiation algorithm for coalition formation
Coalition formation is an important form of interaction in multiagent systems. It enables the agents to satisfy tasks that they would otherwise be unable to perform, or would perf...
Hrishikesh J. Goradia, José M. Vidal
EMNLP
2010
13 years 5 months ago
A New Approach to Lexical Disambiguation of Arabic Text
We describe a model for the lexical analysis of Arabic text, using the lists of alternatives supplied by a broad-coverage morphological analyzer, SAMA, which include stable lemma ...
Rushin Shah, Paramveer S. Dhillon, Mark Liberman, ...
AIPS
2004
13 years 9 months ago
Conformant Planning via Heuristic Forward Search: A New Approach
Conformant planning is the task of generating plans given uncertainty about the initial state and action effects, and without any sensing capabilities during plan execution. The p...
Ronen I. Brafman, Jörg Hoffmann
ACL2
2006
ACM
14 years 1 months ago
A SAT-based procedure for verifying finite state machines in ACL2
We describe a new procedure for verifying ACL2 properties about finite state machines (FSMs) using satisfiability (SAT) solving. We present an algorithm for converting ACL2 conj...
Warren A. Hunt Jr., Erik Reeber