Sciweavers

1695 search results - page 38 / 339
» Linear, Polynomial or Exponential
Sort
View
AICOM
2006
124views more  AICOM 2006»
15 years 4 months ago
A Compact Representation for Least Common Subsumers in the description logic ALE
This paper introduces a compact representation which helps to avoid the exponential blow-up in space of the Least Common Subsumer (lcs) of two ALEconcept descriptions. Based on th...
Chan Le Duc, Nhan Le Thanh, Marie-Christine Rousse...
IJCAI
2001
15 years 5 months ago
The Exponentiated Subgradient Algorithm for Heuristic Boolean Programming
Boolean linear programs (BLPs) are ubiquitous in AI. Satisfiability testing, planning with resource constraints, and winner determination in combinatorial auctions are all example...
Dale Schuurmans, Finnegan Southey, Robert C. Holte
ESA
2000
Springer
84views Algorithms» more  ESA 2000»
15 years 7 months ago
On Representations of Algebraic-Geometric Codes for List Decoding
Abstract. We show that all algebraic-geometric codes possess a succinct representation that allows for the list decoding algorithms of [15, 7] to run in polynomial time. We do this...
Venkatesan Guruswami, Madhu Sudan
TCS
1998
15 years 3 months ago
Dynamical Recognizers: Real-Time Language Recognition by Analog Computers
We consider a model of analog computation which can recognize various languages in real time. We encode an input word as a point in Rd by composing iterated maps, and then apply i...
Cristopher Moore
HYBRID
2009
Springer
15 years 8 months ago
Stabilization of Discrete-Time Switched Linear Systems: A Control-Lyapunov Function Approach
This paper studies the exponential stabilization problem for discrete-time switched linear systems based on a control-Lyapunov function approach. A number of versions of converse c...
Wei Zhang, Alessandro Abate, Jianghai Hu