Sciweavers

446 search results - page 35 / 90
» A new paradigm for programming competitions
Sort
View
EC
2008
146views ECommerce» more  EC 2008»
13 years 8 months ago
Automated Discovery of Local Search Heuristics for Satisfiability Testing
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
Alex S. Fukunaga
ATAL
2010
Springer
13 years 9 months ago
Using answer set programming to model multi-agent scenarios involving agents' knowledge about other's knowledge
One of the most challenging aspects of reasoning, planning, and acting in a multi-agent domain is reasoning about what the agents know about the knowledge of their fellows, and to...
Chitta Baral, Gregory Gelfond, Tran Cao Son, Enric...
ML
2002
ACM
167views Machine Learning» more  ML 2002»
13 years 8 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...
BC
2006
149views more  BC 2006»
13 years 8 months ago
Learning invariant object recognition in the visual system with continuous transformations
Abstract The cerebral cortex utilizes spatiotemporal continuity in the world to help build invariant representations. In vision, these might be representations of objects. The temp...
Simon M. Stringer, G. Perry, Edmund T. Rolls, J. H...
ICSM
2003
IEEE
14 years 2 months ago
Safe Upgrading without Restarting
The distributed development and maintenance paradigm for component delivery is fraught with problems. One wants a relationship between developers and clients that is autonomous an...
Miles Barr, Susan Eisenbach