Sciweavers

394 search results - page 72 / 79
» Logical operations and Kolmogorov complexity
Sort
View
INFORMS
1998
150views more  INFORMS 1998»
13 years 8 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
PERCOM
2007
ACM
13 years 8 months ago
An application adaptation layer for wireless sensor networks
In wireless sensor networks, poor performance or unexpected behavior may be experienced for several reasons, such as trivial deterioration of sensing hardware, unsatisfactory impl...
Marco Avvenuti, Paolo Corsini, Paolo Masci, Alessi...
DAC
2004
ACM
14 years 9 months ago
Virtual memory window for application-specific reconfigurable coprocessors
Reconfigurable Systems-on-Chip (SoCs) on the market consist of full-fledged processors and large Field-Programmable Gate-Arrays (FPGAs). The latter can be used to implement the sy...
Miljan Vuletic, Laura Pozzi, Paolo Ienne
ICDT
2009
ACM
248views Database» more  ICDT 2009»
14 years 9 months ago
Automatic verification of data-centric business processes
We formalize and study business process systems that are centered around "business artifacts", or simply "artifacts". This approach focuses on data records, kn...
Alin Deutsch, Richard Hull, Fabio Patrizi, Victor ...
ICCAD
2006
IEEE
127views Hardware» more  ICCAD 2006»
14 years 5 months ago
Joint design-time and post-silicon minimization of parametric yield loss using adjustable robust optimization
Parametric yield loss due to variability can be effectively reduced by both design-time optimization strategies and by adjusting circuit parameters to the realizations of variable...
Murari Mani, Ashish Kumar Singh, Michael Orshansky