Sciweavers

2181 search results - page 65 / 437
» The restriction scaffold problem
Sort
View
73
Voted
ACL
1994
15 years 2 months ago
Verb Semantics and Lexical Selection
This paper will focus on the semantic representation of verbs in computer systems and its impact on lexical selection problems in machine translation (MT). Two groups of English a...
Zhibiao Wu, Martha Stone Palmer
AI
1998
Springer
15 years 16 days ago
The Logical Foundations of Goal-Regression Planning in Autonomous Agents
This paper addresses the logical foundations of goal-regression planning in autonomous rational agents. It focuses mainly on three problems. The first is that goals and subgoals w...
John L. Pollock
93
Voted
ECAI
2008
Springer
15 years 2 months ago
Single-peaked consistency and its complexity
Abstract. A common way of dealing with the paradoxes of preference aggregation consists in restricting the domain of admissible preferences. The most well-known such restriction is...
Bruno Escoffier, Jérôme Lang, Meltem ...
92
Voted
ENDM
2010
122views more  ENDM 2010»
15 years 27 days ago
Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges
Deciding whether an arbitrary graph admits a VLSI layout with unit-length edges is NP-complete [1], even when restricted to binary trees [7]. However, for certain graphs, the prob...
Vinícius G. P. de Sá, Celina M. Herr...
110
Voted
MFCS
2007
Springer
15 years 7 months ago
NP by Means of Lifts and Shadows
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
Gábor Kun, Jaroslav Nesetril