Sciweavers

2413 search results - page 100 / 483
» Understanding the problem
Sort
View
CONCUR
2004
Springer
15 years 4 months ago
Characterizing EF and EX Tree Logics
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
Mikolaj Bojanczyk, Igor Walukiewicz
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
15 years 11 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
15 years 5 months ago
Finding critical backbone structures with genetic algorithms
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...
Adam Prügel-Bennett
PDC
2004
ACM
15 years 4 months ago
Lost in translation: a critical analysis of actors, artifacts, agendas, and arenas in participatory design
As computer technologies start to permeate the everyday activities of a continuously growing population, social and technical as well as political and legal issues will surface. P...
Rogério De Paula
ECML
1998
Springer
15 years 3 months ago
Learning to Classify X-Ray Images Using Relational Learning
: Image understanding often requires extensive background knowledge. The problem addressed in this paper is such knowledge can be acquired. We discuss how relational machine learni...
Claude Sammut, Tatjana Zrimec