Sciweavers

5052 search results - page 993 / 1011
» On the Complexity of Ordered Colorings
Sort
View
JC
2000
138views more  JC 2000»
13 years 6 months ago
Multivariate Polynomials, Duality, and Structured Matrices
We rst review thebasic properties of the well knownclasses of Toeplitz, Hankel, Vandermonde, and other related structured matrices and reexamine their correlation to operations wi...
Bernard Mourrain, Victor Y. Pan
AAI
1998
112views more  AAI 1998»
13 years 6 months ago
The Robocup Physical Agent Challenge: Phase I
Traditional AI research has not given due attention to the important role that physical bodies play for agents as their interactions produce complex emergent behaviors to achieve ...
Minoru Asada, Peter Stone, Hiroaki Kitano, Barry B...
INFORMS
1998
150views more  INFORMS 1998»
13 years 6 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
JMLR
2002
89views more  JMLR 2002»
13 years 6 months ago
A Robust Minimax Approach to Classification
When constructing a classifier, the probability of correct classification of future data points should be maximized. We consider a binary classification problem where the mean and...
Gert R. G. Lanckriet, Laurent El Ghaoui, Chiranjib...
SIAMCOMP
2002
142views more  SIAMCOMP 2002»
13 years 6 months ago
On Binary Searching with Nonuniform Costs
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur...