Sciweavers

887 search results - page 82 / 178
» A Science of Reasoning
Sort
View
SOFSEM
2004
Springer
14 years 2 months ago
Measures of Intrinsic Hardness for Constraint Satisfaction Problem Instances
Our aim is to investigate the factors which determine the intrinsic hardness of constructing a solution to any particular constraint satisfaction problem instance, regardless of th...
George Boukeas, Constantinos Halatsis, Vassilis Zi...
FOCS
2003
IEEE
14 years 2 months ago
Towards a Characterization of Truthful Combinatorial Auctions
This paper analyzes implementable social choice functions (in dominant strategies) over restricted domains of preferences, the leading example being combinatorial auctions. Our wo...
Ron Lavi, Ahuva Mu'alem, Noam Nisan
FOCS
2003
IEEE
14 years 2 months ago
Zero-Knowledge Sets
We show how a polynomial-time prover can commit to an arbitrary finite set Ë of strings so that, later on, he can, for any string Ü, reveal with a proof whether Ü ¾ Ë or Ü ...
Silvio Micali, Michael O. Rabin, Joe Kilian
SMI
2003
IEEE
143views Image Analysis» more  SMI 2003»
14 years 2 months ago
Rough Surface Modeling Using Surface Growth
In this paper, we present a novel modeling method for synthesizing rough surfaces using discrete surface growth models. We employ a two-pass method. Initial point cluster data is ...
Yootai Kim, Raghu Machiraju, David Thompson
ITICSE
2003
ACM
14 years 2 months ago
The evaluation of electronic marking of examinations
This paper discusses an approach to the electronic (automatic) marking of examination papers, in particular, the extent to which it is possible to mark a candidate’s answers aut...
Pete Thomas