Sciweavers

1723 search results - page 123 / 345
» Cycling in linear programming problems
Sort
View
EVOW
2003
Springer
15 years 3 months ago
Pixel Statistics and False Alarm Area in Genetic Programming for Object Detection
This paper describes a domain independent approach to the use of genetic programming for object detection problems. Rather than using raw pixels or high level domain specific feat...
Mengjie Zhang, Peter Andreae, Mark Pritchard
IJCAI
2001
14 years 11 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
JISE
2006
76views more  JISE 2006»
14 years 10 months ago
Process and Planning Support for Iterative Porting
in an abstract Cartesian space of program versions characterized by dialect variables. An optimal solution to the problem is derived based on its translation to a restricted Intege...
Pradeep Varma
ICML
2010
IEEE
14 years 11 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
CC
2007
Springer
129views System Software» more  CC 2007»
15 years 4 months ago
Extended Linear Scan: An Alternate Foundation for Global Register Allocation
In this paper, we extend past work on Linear Scan register allocation, and propose two Extended Linear Scan (ELS) algorithms that retain the compiletime efficiency of past Linear ...
Vivek Sarkar, Rajkishore Barik