Sciweavers

3628 search results - page 195 / 726
» The Decision Diffie-Hellman Problem
Sort
View
139
Voted
COMPGEOM
1998
ACM
15 years 7 months ago
Geometric Applications of a Randomized Optimization Technique
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
Timothy M. Chan
140
Voted
COLT
2006
Springer
15 years 7 months ago
Online Learning with Constraints
In this paper, we study a sequential decision making problem. The objective is to maximize the total reward while satisfying constraints, which are defined at every time step. The...
Shie Mannor, John N. Tsitsiklis
151
Voted
JAR
2006
106views more  JAR 2006»
15 years 3 months ago
Some Computational Aspects of distance-sat
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
Olivier Bailleux, Pierre Marquis
129
Voted
ICDM
2009
IEEE
142views Data Mining» more  ICDM 2009»
15 years 1 months ago
Building Classifiers with Independency Constraints
In this paper we study the problem of classifier learning where the input data contains unjustified dependencies between some data attributes and the class label. Such cases arise...
Toon Calders, Faisal Kamiran, Mykola Pechenizkiy
128
Voted
ICTAI
2005
IEEE
15 years 9 months ago
Planning with POMDPs Using a Compact, Logic-Based Representation
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...
Chenggang Wang, James G. Schmolze