Sciweavers

260 search results - page 32 / 52
» Hardness of Parameterized Resolution
Sort
View
ICDCS
1998
IEEE
15 years 6 months ago
A Protocol and Correctness Proofs for Real-Time High-Performance Broadcast Networks
Novel real-time applications require highperformance real-time distributed systems, and therefore high-performance real-time networks. We examine a Hard Real-Time Distributed Mult...
Jean-François Hermant, Gérard Le Lan...
CONSTRAINTS
1998
94views more  CONSTRAINTS 1998»
15 years 1 months ago
Resource Constraints for Preemptive Job-shop Scheduling
This paper presents an experimental study of constraint propagation algorithms for preemptive scheduling. We propose generalizations of non-preemptive constraint propagation techni...
Claude Le Pape, Philippe Baptiste
ISAAC
2003
Springer
133views Algorithms» more  ISAAC 2003»
15 years 7 months ago
The Intractability of Computing the Hamming Distance
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
Bodo Manthey, Rüdiger Reischuk
CVPR
2008
IEEE
16 years 3 months ago
Large margin pursuit for a Conic Section classifier
Learning a discriminant becomes substantially more difficult when the datasets are high-dimensional and the available samples are few. This is often the case in computer vision an...
Santhosh Kodipaka, Arunava Banerjee, Baba C. Vemur...
ESOP
2010
Springer
15 years 11 months ago
Faulty Logic: Reasoning about Fault Tolerant Programs
Transient faults are single-shot hardware errors caused by high energy particles from space, manufacturing defects, overheating, and other sources. Such faults can be devastating f...
Matthew L. Meola and David Walker