Sciweavers

709 search results - page 77 / 142
» On LR(k)-Parsers of Polynomial Size
Sort
View
FQAS
2009
Springer
127views Database» more  FQAS 2009»
15 years 4 months ago
Finding Top-k Approximate Answers to Path Queries
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
ISAAC
2009
Springer
109views Algorithms» more  ISAAC 2009»
15 years 4 months ago
A Linear Vertex Kernel for Maximum Internal Spanning Tree
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh, St&e...
TARK
2009
Springer
15 years 4 months ago
Logical omniscience as a computational complexity problem
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
Sergei N. Artëmov, Roman Kuznets
DSD
2008
IEEE
95views Hardware» more  DSD 2008»
15 years 4 months ago
Programmable Numerical Function Generators for Two-Variable Functions
This paper proposes a design method and programmable architectures for numerical function generators (NFGs) of two-variable functions. To realize a two-variable function in hardwa...
Shinobu Nagayama, Jon T. Butler, Tsutomu Sasao
CEC
2007
IEEE
15 years 4 months ago
Plateaus can be harder in multi-objective optimization
—In recent years a lot of progress has been made in understanding the behavior of evolutionary computation methods for single- and multi-objective problems. Our aim is to analyze...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann