Sciweavers

2245 search results - page 406 / 449
» A Case Study Implementing Features Using AspectJ
Sort
View
JAR
2000
145views more  JAR 2000»
15 years 2 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro
ICFEM
2009
Springer
15 years 9 months ago
Approximate Model Checking of PCTL Involving Unbounded Path Properties
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
Samik Basu, Arka P. Ghosh, Ru He
116
Voted
PARELEC
2006
IEEE
15 years 8 months ago
MPI and Non-MPI Simulations for Epitaxial Surface Growth
Usually, theories of surface growth are based on the study of global processes without taking in account the local behaviour of atoms. We have implemented two Montecarlo simulation...
Carmen B. Navarrete, Susana Holgado, Eloy Anguiano
GLOBECOM
2009
IEEE
15 years 6 months ago
Optimal Resource Scheduling in Wireless Multiservice Systems with Random Channel Connectivity
We investigate an optimal scheduling problem in a discrete-time system of L parallel queues that are served by K identical servers. This model has been widely used in studies of em...
Hussein Al-Zubaidy, Ioannis Lambadaris, Ioannis Vi...
139
Voted
COMPGEOM
2006
ACM
15 years 6 months ago
I/O-efficient batched union-find and its applications to terrain analysis
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
Pankaj K. Agarwal, Lars Arge, Ke Yi