Sciweavers

1995 search results - page 38 / 399
» What's the Problem
Sort
View
BIRTHDAY
2008
Springer
15 years 4 months ago
Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey
Abstract. A formula ψ(Y ) is a selector for a formula ϕ(Y ) in a structure M if there exists a unique Y that satisfies ψ in M and this Y also satisfies ϕ. A formula ψ(X, Y )...
Alexander Rabinovich, Amit Shomrat
138
Voted
IJCAI
1993
15 years 4 months ago
Using Inferred Disjunctive Constraints To Decompose Constraint Satisfaction Problems
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many...
Eugene C. Freuder, Paul D. Hubbe
SODA
2001
ACM
92views Algorithms» more  SODA 2001»
15 years 4 months ago
On universally easy classes for NP-complete problems
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
Erik D. Demaine, Alejandro López-Ortiz, J. ...
DAGSTUHL
2004
15 years 4 months ago
The communication complexity of the Exact-N Problem revisited
If Alice has x, y, Bob has x, z and Carol has y, z can they determine if x + y + z = N? They can if (say) Alice broadcasts x to Bob and Carol; can they do better? Chandra, Furst, a...
William I. Gasarch, James Glenn, Andrey Utis
119
Voted
AAAI
1998
15 years 4 months ago
Machine Learning of Generic and User-Focused Summarization
A key problem in text summarization is finding a salience function which determines what information in the source should be included in the summary. This paper describes the use ...
Inderjeet Mani, Eric Bloedorn