Sciweavers

346 search results - page 62 / 70
» Logical omniscience as a computational complexity problem
Sort
View
INFORMS
1998
150views more  INFORMS 1998»
13 years 7 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
PODS
2011
ACM
201views Database» more  PODS 2011»
12 years 10 months ago
Data exchange beyond complete data
In the traditional data exchange setting, source instances are restricted to be complete in the sense that every fact is either true or false in these instances. Although natural ...
Marcelo Arenas, Jorge Pérez, Juan L. Reutte...
DAC
2005
ACM
14 years 8 months ago
Race-condition-aware clock skew scheduling
The race conditions often limit the smallest feasible clock period that the optimal clock skew scheduling can achieve. Therefore, the combination of clock skew scheduling and dela...
Shih-Hsu Huang, Yow-Tyng Nieh, Feng-Pin Lu
DAC
2006
ACM
14 years 8 months ago
Scheduling-based test-case generation for verification of multimedia SoCs
Multimedia SoCs are characterized by a main controller that directs the activity of several cores, each of which is in charge of a stage in the processing of a media stream. The v...
Amir Nahir, Avi Ziv, Roy Emek, Tal Keidar, Nir Ron...
PERCOM
2006
ACM
14 years 7 months ago
Managing Pervasive Systems using Role-based Obligation Policies
Pervasive systems are complex distributed systems containing heterogeneous and mobile devices, services and applications. Policy-based management is an effective approach for mana...
Chetan Shiva Shankar, Roy H. Campbell