Sciweavers

664 search results - page 75 / 133
» Some results for a class of generalized polynomials
Sort
View
WINE
2005
Springer
122views Economy» more  WINE 2005»
15 years 3 months ago
Walrasian Equilibrium: Hardness, Approximations and Tractable Instances
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
Ning Chen, Atri Rudra
AAAI
2008
15 years 4 days ago
How Good is Almost Perfect?
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...
Malte Helmert, Gabriele Röger
EJC
2008
14 years 10 months ago
On digraph coloring problems and treewidth duality
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
Albert Atserias
AMC
2007
177views more  AMC 2007»
14 years 10 months ago
Quadratic stability and stabilization of switched dynamic systems with uncommensurate internal point delays
This paper deals with the quadratic stability and linear state-feedback and output-feedback stabilization of switched delayed linear dynamic systems with, in general, a finite nu...
Manuel de la Sen
DNA
2007
Springer
176views Bioinformatics» more  DNA 2007»
15 years 4 months ago
Asynchronous Spiking Neural P Systems: Decidability and Undecidability
In search for “realistic” bio-inspired computing models, we consider asynchronous spiking neural P systems, in the hope to get a class of computing devices with decidable prope...
Matteo Cavaliere, Ömer Egecioglu, Oscar H. Ib...