Sciweavers

4438 search results - page 288 / 888
» The Case for Collaborative Programming
Sort
View
NIPS
2008
15 years 8 months ago
Biasing Approximate Dynamic Programming with a Lower Discount Factor
Most algorithms for solving Markov decision processes rely on a discount factor, which ensures their convergence. It is generally assumed that using an artificially low discount f...
Marek Petrik, Bruno Scherrer
ACSW
2004
15 years 8 months ago
Applying Online Gradient Descent Search to Genetic Programming for Object Recognition
This paper describes an approach to the use of gradient descent search in genetic programming (GP) for object classification problems. In this approach, pixel statistics are used ...
William D. Smart, Mengjie Zhang
IJCAI
2001
15 years 8 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
AAAI
1994
15 years 8 months ago
Recovering Software Specifications with Inductive Logic Programming
We consider using machine learning techniques to help understand a large software system. In particular, we describe how learning techniques can be used to reconstruct abstract Da...
William W. Cohen
CCE
2006
15 years 6 months ago
An efficient algorithm for large scale stochastic nonlinear programming problems
The class of stochastic nonlinear programming (SNLP) problems is important in optimization due to the presence of nonlinearity and uncertainty in many applications, including thos...
Y. Shastri, Urmila M. Diwekar