Sciweavers

11740 search results - page 202 / 2348
» More Problems in Rewriting
Sort
View
COGSCI
2010
75views more  COGSCI 2010»
15 years 4 months ago
Moral Principles or Consumer Preferences? Alternative Framings of the Trolley Problem
We created paired moral dilemmas with minimal contrasts in wording, a research strategy that has been advocated as a way to empirically establish principles operative in a domain-...
Tage S. Rai, Keith J. Holyoak
TCOM
2008
117views more  TCOM 2008»
15 years 4 months ago
Nested turbo codes for the Costa problem
Driven by applications in data-hiding, MIMO broadcast channel coding, precoding for interference cancellation, and transmitter cooperation in wireless networks, Costa coding has la...
Yong Sun, Momin Uppal, Angelos D. Liveris, Samuel ...
JAIR
1998
92views more  JAIR 1998»
15 years 4 months ago
The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
Basil Vandegriend, Joseph C. Culberson
CVPR
2012
IEEE
13 years 7 months ago
What is optimized in tight convex relaxations for multi-label problems?
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...
Christopher Zach, Christian Hane, Marc Pollefeys
CADE
2008
Springer
16 years 4 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard