Sciweavers

6020 search results - page 899 / 1204
» A New Approach to Model Counting
Sort
View
ECAI
1998
Springer
15 years 10 months ago
Optimal Scheduling of Dynamic Progressive Processing
Progressive processing allows a system to satisfy a set of requests under time pressure by limiting the amount of processing allocated to each task based on a predefined hierarchic...
Abdel-Illah Mouaddib, Shlomo Zilberstein
MICRO
1996
IEEE
106views Hardware» more  MICRO 1996»
15 years 10 months ago
Optimization of Machine Descriptions for Efficient Use
A machine description facility allows compiler writers to specify machine execution constraints to the optimization and scheduling phases of an instruction-level parallelism (ILP)...
John C. Gyllenhaal, Wen-mei W. Hwu, B. Ramakrishna...
ACMICEC
2007
ACM
144views ECommerce» more  ACMICEC 2007»
15 years 10 months ago
Needs-based analysis of online customer reviews
Needs-based analysis lies at the intersection of product marketing and new product development. It is the study of why consumers purchase and what they do with those purchases. In...
Thomas Y. Lee
SIGGRAPH
1991
ACM
15 years 10 months ago
Design and simulation of opera lighting and projection effects
A major problem challenging opera designers is the inability to coordinate lighting, projection systems, and set designs in the preliminary planning phase. New computer graphics t...
Julie Dorsey, François X. Sillion, Donald P...
AIMSA
2008
Springer
15 years 8 months ago
DynABT: Dynamic Asynchronous Backtracking for Dynamic DisCSPs
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
Bayo Omomowo, Inés Arana, Hatem Ahriz