Sciweavers

13457 search results - page 113 / 2692
» Can we elect if we cannot compare
Sort
View
CONSTRAINTS
1998
94views more  CONSTRAINTS 1998»
13 years 8 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
COLING
1996
13 years 10 months ago
Focus and Higher-Order Unification
2 Focus theory Pulman has shown that Higher-Order Unifcation (HOU) can be used to model the interpretation of focus. In this paper, we extend the unification based approach to case...
Claire Gardent, Michael Kohlhase
SAT
2011
Springer
263views Hardware» more  SAT 2011»
12 years 12 months ago
Failed Literal Detection for QBF
Failed literal detection (FL) in SAT is a powerful approach for preprocessing. The basic idea is to assign a variable as assumption. If boolean constraint propagation (BCP) yields ...
Florian Lonsing, Armin Biere
CVPR
2010
IEEE
14 years 5 months ago
Automatic Point-based Facial Trait Judgments Evaluation
Humans constantly evaluate the personalities of other people using their faces. Facial trait judgments have been studied in the psychological field, and have been determined to i...
Mario Rojas, David Masip, jordi Vitria
SP
2006
IEEE
14 years 3 months ago
Deterring Voluntary Trace Disclosure in Re-encryption Mix Networks
An all too real threat to the privacy offered by a mix network is that individual mix administrators may volunteer partial tracing information to a coercer. While this threat can ...
Philippe Golle, XiaoFeng Wang, Markus Jakobsson, A...