Sciweavers

339 search results - page 4 / 68
» Universality Results for Models in Locally Boolean Domains
Sort
View
LOGCOM
2010
158views more  LOGCOM 2010»
13 years 5 months ago
Applying Universal Algebra to Lambda Calculus
The aim of this paper is double. From one side we survey the knowledge we have acquired these last ten years about the lattice of all λ-theories (= equational extensions of untype...
Giulio Manzonetto, Antonino Salibra
JAIR
2000
96views more  JAIR 2000»
13 years 7 months ago
OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains
Recently model checking representation and search techniques were shown to be efciently applicable to planning, in particular to non-deterministic planning. Such planning approach...
Rune M. Jensen, Manuela M. Veloso
CAV
2009
Springer
165views Hardware» more  CAV 2009»
14 years 8 months ago
Symbolic Counter Abstraction for Concurrent Software
Counter Abstraction for Concurrent Software G?erard Basler1 , Michele Mazzucchi1 , Thomas Wahl1,2 , Daniel Kroening1,2 1 Computer Systems Institute, ETH Zurich, Switzerland 2 Compu...
Daniel Kroening, Gérard Basler, Michele Maz...
AUSDM
2006
Springer
144views Data Mining» more  AUSDM 2006»
13 years 11 months ago
A Characterization of Wordnet Features in Boolean Models For Text Classification
Supervised text classification is the task of automatically assigning a category label to a previously unlabeled text document. We start with a collection of pre-labeled examples ...
Trevor N. Mansuy, Robert J. Hilderman
COMPGEOM
2003
ACM
14 years 22 days ago
Local polyhedra and geometric graphs
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
Jeff Erickson