Sciweavers

274 search results - page 22 / 55
» mc 2003
Sort
View
CSR
2007
Springer
14 years 1 months ago
Equivalence Problems for Circuits over Sets of Natural Numbers
We investigate the complexity of equivalence problems for {∪, ∩, − , +, ×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer an...
Christian Glaßer, Katrin Herr, Christian Rei...
EUSAI
2003
Springer
14 years 22 days ago
Towards Computer Understanding of Human Interactions
People meet in order to interact - disseminating information, making decisions, and creating new ideas. Automatic analysis of meetings is therefore important from two points of vie...
Iain McCowan, Daniel Gatica-Perez, Samy Bengio, Da...
MEMOCODE
2003
IEEE
14 years 23 days ago
Methods for exploiting SAT solvers in unbounded model checking
— Modern SAT solvers have proved highly successful in finding counterexamples to temporal properties of systems, using a method known as ”bounded model checking”. It is natu...
Kenneth L. McMillan
ATAL
2003
Springer
13 years 11 months ago
Democracy in open agent systems
What sort of democracies should open agent societies be? We present three normative models of democracy from political philosophy and consider their relevance for the engineering o...
Peter McBurney, Simon Parsons
COMPGEOM
2003
ACM
14 years 23 days ago
Loops in reeb graphs of 2-manifolds
Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...
Kree Cole-McLaughlin, Herbert Edelsbrunner, John H...