Sciweavers

844 search results - page 17 / 169
» Solving the p
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
SEAMLESS P2P-MDVC with well-balanced descriptions
Multiple-description coding (MDC) provides a promising solution to support the error-prone transmission over multiple channels. One extremely important application is to design ef...
Shuyuan Zhu, Jeff Siu-Kei Au-Yeung, Bing Zeng
ARITH
2009
IEEE
15 years 4 months ago
IEEE Interval Standard Working Group - P1788: Current Status
Late 2008, at SCAN 2008 in El Paso, TX, an effort to standardize interval computations was started by a working group of the IEEE Microprocessor Standards Committee, titled the In...
William Edmonson, Guillaume Melquiond
OPODIS
1997
14 years 11 months ago
Solving Consensus in a Byzantine Environment Using an Unreliable Fault Detector
Unreliable fault detectors can be used to solve the consensus problem in asynchronous distributed systems that are subject to crash faults. We extend this result to asynchronous d...
Kim Potter Kihlstrom, Louise E. Moser, P. M. Melli...
CP
2000
Springer
15 years 1 months ago
Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability
This paper addresses the interaction between randomization, with restart strategies, and learning, an often crucial technique for proving unsatisfiability. We use instances of SAT ...
Luís Baptista, João P. Marques Silva
AAAI
1994
14 years 11 months ago
GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement
New approaches to solving constraint satisfaction problems using iterative improvement techniques have been found to be successful on certain, very large problems such as the mill...
Andrew J. Davenport, Edward P. K. Tsang, Chang J. ...