Sciweavers

CORR
2008
Springer
127views Education» more  CORR 2008»
13 years 11 months ago
Branching proofs of infeasibility in low density subset sum problems
We prove that the subset sum problem ax = x {0, 1}n (SUB) has a polynomial time computable certificate of infeasibility for all a with density at most 1/(2n), and for almost all ...
Gábor Pataki, Mustafa Tural
CHI
1997
ACM
14 years 3 months ago
Cooperative Bimanual Action
We present an experiment on cooperative bimanual action. Right-handed subjects manipulated a pair of physical objects, a tool and a target object, so that the tool would touch a t...
Ken Hinckley, Randy F. Pausch, Dennis Proffitt, Ja...
BIRTHDAY
2005
Springer
14 years 4 months ago
Reducing Right-Hand Sides for Termination
We propose two transformations on term rewrite systems (TRSs) based on reducing right hand sides: one related to the transformation order and a variant of dummy elimination. Under ...
Hans Zantema