Sciweavers

1795 search results - page 143 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
CONCUR
2009
Springer
14 years 27 days ago
Time-Bounded Verification
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
Joël Ouaknine, Alexander Rabinovich, James Wo...
ATAL
2006
Springer
14 years 21 days ago
Temporal qualitative coalitional games
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...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
EAAI
2006
123views more  EAAI 2006»
13 years 9 months ago
Applications of artificial intelligence for optimization of compressor scheduling
This paper presents a feasibility study of evolutionary scheduling for gas pipeline operations. The problem is complex because of several constraints that must be taken into consi...
Hanh H. Nguyen, Christine W. Chan
FUIN
2000
71views more  FUIN 2000»
13 years 8 months ago
The Nondeterministic Information Logic NIL is PSPACE-complete
The nondeterministic information logic NIL has been introduced by Orlowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forw...
Stéphane Demri
AAAI
2012
11 years 11 months ago
Threats and Trade-Offs in Resource Critical Crowdsourcing Tasks Over Networks
In recent times, crowdsourcing over social networks has emerged as an active tool for complex task execution. In this paper, we address the problem faced by a planner to incentivi...
Swaprava Nath, Pankaj Dayama, Dinesh Garg, Y. Nara...