Sciweavers

1418 search results - page 174 / 284
» The Dynamic Complexity of Formal Languages
Sort
View
161
Voted
ATVA
2007
Springer
136views Hardware» more  ATVA 2007»
15 years 11 months ago
Symbolic Fault Tree Analysis for Reactive Systems
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...
Marco Bozzano, Alessandro Cimatti, Francesco Tappa...
PPSN
1992
Springer
15 years 8 months ago
Hyperplane Annealing and Activator-Inhibitor-Systems
This paper introduces a new optimization technique called hyperplane annealing. It is similar to the mean field annealing approach to combinatorial optimization. Both annealing te...
Thomas Laußermair
ENC
2004
IEEE
15 years 8 months ago
A New Cache Approach Based on Graph for Web Servers
This article deals with the problem of data cache for dynamic web servers. A set of requests (which number could be large) is submitted to a server for computing. Every request is...
Euloge Edi, Denis Trystram, Jean-Marc Vincent
ICFP
2002
ACM
16 years 4 months ago
A demand-driven adaptive type analysis
Compilers for dynamically and statically typed languages ensure safe execution by verifying that all operations are performed on appropriate values. An operation as simple as car ...
Danny Dubé, Marc Feeley
WSDM
2009
ACM
148views Data Mining» more  WSDM 2009»
15 years 11 months ago
Information arbitrage across multi-lingual Wikipedia
The rapid globalization of Wikipedia is generating a parallel, multi-lingual corpus of unprecedented scale. Pages for the same topic in many different languages emerge both as a r...
Eytan Adar, Michael Skinner, Daniel S. Weld