1743 search results - page 97 / 349 » Generalized Modal Satisfiability |
106
click to vote
DAC
2004
ACM
16 years 1 months ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
DAC
2005
ACM
16 years 1 months ago
2005
ACM
This paper attempts to quantify the optimality of FPGA technology mapping algorithms. We develop an algorithm, based on Boolean satisfiability (SAT), that is able to map a small s...
108
Voted
ICRA
2007
IEEE
15 years 7 months ago
2007
IEEE
— Given a robot model and a class of admissible environments, this paper provides a framework for automatically and verifiably composing controllers that satisfy high level task...
130
Voted
NETGAMES
2006
ACM
15 years 6 months ago
2006
ACM
Supporting thousands, possibly hundreds of thousands, of players is a requirement that must be satisfied when delivering server based online gaming as a commercial concern. Such a...
129
Voted
ATAL
2006
Springer
15 years 4 months ago
2006
Springer
Qualitative Coalitional Games (QCGs) are a version of coalitional games in which an agent's desires are represented as goals which are either satisfied or unsatisfied, and ea...