Sciweavers

1888 search results - page 213 / 378
» Proof theory and computational analysis
Sort
View
GECCO
2007
Springer
136views Optimization» more  GECCO 2007»
16 years 1 months ago
Do additional objectives make a problem harder?
In this paper, we examine how adding objectives to a given optimization problem affects the computation effort required to generate the set of Pareto-optimal solutions. Experime...
Dimo Brockhoff, Tobias Friedrich, Nils Hebbinghaus...
CORR
2012
Springer
286views Education» more  CORR 2012»
14 years 2 months ago
A Faster Algorithm for Solving One-Clock Priced Timed Games
One-clock priced timed games is a class of two-player, zero-sum, continuous-time games that was defined and thoroughly studied in previous works. We show that One-clock priced ti...
Thomas Dueholm Hansen, Rasmus Ibsen-Jensen, Peter ...
ISTCS
1997
Springer
15 years 10 months ago
Learning with Queries Corrupted by Classification Noise
Kearns introduced the "statistical query" (SQ) model as a general method for producing learning algorithms which are robust against classification noise. We extend this ...
Jeffrey C. Jackson, Eli Shamir, Clara Shwartzman
ITICSE
2005
ACM
16 years 21 days ago
Reductive thinking in undergraduate CS courses
This paper describes research on the perception of undergraduate students of the concept of reduction. Specifically, based on an analysis of students' answers to questions ad...
Michal Armoni, Judith Gal-Ezer
DIS
2008
Springer
15 years 9 months ago
Constructing Iceberg Lattices from Frequent Closures Using Generators
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...
Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, R...