Sciweavers

4155 search results - page 607 / 831
» External Memory Algorithms
Sort
View
ENTCS
2006
134views more  ENTCS 2006»
15 years 2 months ago
Computing Over-Approximations with Bounded Model Checking
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
Daniel Kroening
ENTCS
2006
137views more  ENTCS 2006»
15 years 2 months ago
An Efficient Method for Computing Exact State Space of Petri Nets With Stopwatches
In this paper, we address the issue of the formal verification of real-time systems in the context of a preemptive scheduling policy. We propose an algorithm which computes the st...
Morgan Magnin, Didier Lime, Olivier H. Roux
EOR
2006
62views more  EOR 2006»
15 years 2 months ago
A sequential procedure for neighborhood selection-of-the-best in optimization via simulation
We propose a fully sequential indifference-zone selection procedure that is specifically for use within an optimization-via-simulation algorithm when simulation is costly, and par...
Juta Pichitlamken, Barry L. Nelson, L. Jeff Hong
113
Voted
IJDE
2006
116views more  IJDE 2006»
15 years 2 months ago
Forensics and SIM Cards: An Overview
Nowadays there are many tools for the extraction of data objects [SWGDE] from SIM cards; unfortunately, most of them are proprietary, or their use is restricted to law enforcement...
Fabio Casadei, Antonio Savoldi, Paolo Gubian
117
Voted
JUCS
2008
127views more  JUCS 2008»
15 years 2 months ago
An LALR Parser Generator Supporting Conflict Resolution
: Despite all the advance brought by LALR parsing method by DeRemer in the late 60's, conflicts continue to be removed in a non-productive way, by means of analysis of a huge ...
Leonardo Teixeira Passos, Mariza Andrade da Silva ...