3946 search results - page 330 / 790 » The computational complexity of choice sets |
135
Voted
APAL
2008
15 years 7 months ago
2008
We study and compare two combinatorial lowness notions: strong jump-traceability and well-approximability of the jump, by strengthening the notion of jump-traceability and super-l...
158
click to vote
EDBT
2006
ACM
16 years 7 months ago
2006
ACM
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
146
click to vote
ICCD
2006
IEEE
16 years 3 months ago
2006
IEEE
— In this paper, we present a comprehensive energy estimation framework for software executing on Very Long Instruction Word (VLIW) processor cores. The proposed energy model is ...
154
click to vote
CEC
2003
IEEE
16 years 3 days ago
2003
IEEE
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...
178
click to vote
ESA
2003
Springer
16 years 1 days ago
2003
Springer
This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smo...