Sciweavers

2052 search results - page 194 / 411
» Direct Combination
Sort
View
CISSE
2008
Springer
15 years 5 months ago
From Constraints to Resolution Rules Part I : conceptual framework
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
Denis Berthier
CORR
2010
Springer
124views Education» more  CORR 2010»
15 years 4 months ago
Integer-Forcing Linear Receivers
Abstract--Linear receivers are often used to reduce the implementation complexity of multiple antenna systems. In a traditional linear receiver architecture, the receive antennas a...
Jiening Zhan, Bobak Nazer, Uri Erez, Michael Gastp...
IJISEC
2006
106views more  IJISEC 2006»
15 years 4 months ago
Execution transactions for defending against software failures: use and evaluation
We examine the problem of containing buffer overflow attacks in a safe and efficient manner. Briefly, we automatically augment source code to dynamically catch stack and heap-based...
Stelios Sidiroglou, Angelos D. Keromytis
IFIP
2010
Springer
14 years 11 months ago
Model Checking of Concurrent Algorithms: From Java to C
Concurrent software is difficult to verify. Because the thread schedule is not controlled by the application, testing may miss defects that occur under specific thread schedules. T...
Cyrille Artho, Masami Hagiya, Watcharin Leungwatta...
ACRI
2004
Springer
15 years 9 months ago
Optimizing the Behavior of a Moving Creature in Software and in Hardware
We have investigated a problem where the goal is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type OBSTACLE, EMPTY or CRE...
Mathias Halbach, Wolfgang Heenes, Rolf Hoffmann, J...