Sciweavers

366 search results - page 42 / 74
» Four equivalent equivalences of reductions
Sort
View
SYNASC
2008
IEEE
239views Algorithms» more  SYNASC 2008»
16 years 15 days ago
Undecidability Results for Finite Interactive Systems
Abstract. A new approach to the design of massively parallel and interactive programming languages has been recently proposed using rv-systems (interactive systems with registers a...
Alexandru Sofronia, Alexandru Popa, Gheorghe Stefa...
LPAR
2007
Springer
16 years 7 days ago
The Complexity of Temporal Logic with Until and Since over Ordinals
Abstract. We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic thanks to ...
Stéphane Demri, Alexander Rabinovich
ICCAD
2006
IEEE
146views Hardware» more  ICCAD 2006»
16 years 5 days ago
Cost-aware synthesis of asynchronous circuits based on partial acknowledgement
Designing asynchronous circuits by reusing existing synchronous tools has become a promising solution to the problem of poor CAD support in asynchronous world. A straightforward w...
Yu Zhou, Danil Sokolov, Alexandre Yakovlev
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
15 years 11 months ago
EA models and population fixed-points versus mutation rates for functions of unitation
Using a dynamic systems model for the Simple Genetic Algorithm due to Vose[1], we analyze the fixed point behavior of the model without crossover applied to functions of unitation...
J. Neal Richter, John Paxton, Alden H. Wright
TARK
2005
Springer
15 years 11 months ago
Semantics for multi-agent only knowing: extended abstract
s for Multi-Agent Only Knowing (extended abstract) Arild Waaler1,2 and Bjørnar Solhaug3,4 1 Finnmark College, Norway 2 Dep. of Informatics, University of Oslo, Norway 3 SINTEF ICT...
Arild Waaler, Bjørnar Solhaug