Sciweavers

11160 search results - page 100 / 2232
» Incompleteness in a General Setting
Sort
View
SIAMDM
2010
123views more  SIAMDM 2010»
13 years 8 months ago
Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons
We consider a variation of a problem stated by Erd˝os and Szekeres in 1935 about the existence of a number fES (k) such that any set S of at least fES (k) points in general posit...
Oswin Aichholzer, Thomas Hackl, Clemens Huemer, Fe...
EJC
2010
13 years 10 months ago
Partitions versus sets: A case of duality
In a recent paper, Amini et al. introduced a general framework to prove duality theorems between tree decompositions and their dual combinatorial object. They unify all known ad-h...
Laurent Lyaudet, Frédéric Mazoit, St...
AAAI
1998
13 years 11 months ago
Hybrid Planning for Partially Hierarchical Domains
Hierarchical task network and action-based planning approaches have traditionally been studied separately. In many domains, human expertise in the form of hierarchical reduction s...
Subbarao Kambhampati, Amol Dattatraya Mali, Biplav...
COMPUTING
2004
87views more  COMPUTING 2004»
13 years 9 months ago
The Generalized Quantum Database Search Algorithm
In this paper we present a generalized description of the Grover operator, employed in a quantum database search algorithm. We will discuss the relation between the original and ge...
Sándor Imre, Ferenc Balázs
AAECC
1998
Springer
88views Algorithms» more  AAECC 1998»
13 years 9 months ago
A Generalization of the Massey-Ding Algorithm
The set of all linear recurrence relations satisfied by given sequences of finite length is described by the annihilator ideal of the sequences. The MasseyDing algorithm to compu...
Joachim Althaler, Arne Dür