Sciweavers

881 search results - page 64 / 177
» Solving satisfiability problems with preferences
Sort
View
CSJM
2006
76views more  CSJM 2006»
13 years 8 months ago
Graph Coloring using Peer-to-Peer Networks
The popularity of distributed file systems continues to grow in last years. The reasons they are preferred over traditional centralized systems include fault tolerance, availabili...
Adrian Iftene, Cornelius Croitoru
CCE
2008
13 years 8 months ago
Chance constrained programming approach to process optimization under uncertainty
Deterministic optimization approaches have been well developed and widely used in the process industry to accomplish off-line and on-line process optimization. The challenging tas...
Pu Li, Harvey Arellano-Garcia, Günter Wozny
SOFSEM
2012
Springer
12 years 4 months ago
Recent Challenges and Ideas in Temporal Synthesis
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification against all environments. While modelchecking theory has led to...
Orna Kupferman
CP
2009
Springer
14 years 9 months ago
Minimising Decision Tree Size as Combinatorial Optimisation
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
Christian Bessiere, Emmanuel Hebrard, Barry O'Sull...
WCNC
2010
IEEE
14 years 19 days ago
Network Selection in Heterogeneous Wireless Networks: Evolution with Incomplete Information
—Enabling users to connect to the best available network, dynamic network selection scheme is important for satisfying various quality of service (QoS) requirements, achieving se...
Kun Zhu, Dusit Niyato, Ping Wang