Sciweavers

971 search results - page 172 / 195
» Approximate Satisfiability and Equivalence
Sort
View
ANSS
2007
IEEE
15 years 3 months ago
An Accurate and Efficient Time-Division Parallelization of Cycle Accurate Architectural Simulators
This paper proposes a parallel cycle-accurate microarchitectural simulator which efficiently executes its workload by splitting the simulation process along time-axis into many in...
Masahiro Yano, Toru Takasaki, Takashi Nakada, Hiro...
SODA
2003
ACM
167views Algorithms» more  SODA 2003»
15 years 1 months ago
Counting inversions in lists
In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Ä ¾ Ñ Ò using two passes and Ç´¯ ½ ÔÒÐÓ Ò´ÐÓ Ñ·ÐÓ...
Anupam Gupta, Francis Zane
JALC
2007
90views more  JALC 2007»
14 years 11 months ago
Learning Unary Automata
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
Gregor Gramlich, Ralf Herrmann
CORR
2007
Springer
217views Education» more  CORR 2007»
14 years 11 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
JCPHY
2011
133views more  JCPHY 2011»
14 years 2 months ago
A Riemann solver for single-phase and two-phase shallow flow models based on relaxation. Relations with Roe and VFRoe solvers
We present a Riemann solver derived by a relaxation technique for classical single-phase shallow flow equations and for a two-phase shallow flow model describing a mixture of so...
Marica Pelanti, François Bouchut, Anne Mang...