Sciweavers

1452 search results - page 250 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
FOCS
1989
IEEE
14 years 1 months ago
Constant Depth Circuits, Fourier Transform, and Learnability
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
Nathan Linial, Yishay Mansour, Noam Nisan
ICALP
2011
Springer
13 years 1 months ago
On Tree-Constrained Matchings and Generalizations
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...
JMLR
2011
117views more  JMLR 2011»
13 years 4 months ago
Parameter Screening and Optimisation for ILP using Designed Experiments
Reports of experiments conducted with an Inductive Logic Programming system rarely describe how specific values of parameters of the system are arrived at when constructing model...
Ashwin Srinivasan, Ganesh Ramakrishnan
KDD
2003
ACM
205views Data Mining» more  KDD 2003»
14 years 10 months ago
The data mining approach to automated software testing
In today's industry, the design of software tests is mostly based on the testers' expertise, while test automation tools are limited to execution of pre-planned tests on...
Mark Last, Menahem Friedman, Abraham Kandel
ATAL
2008
Springer
13 years 11 months ago
Solving two-person zero-sum repeated games of incomplete information
In repeated games with incomplete information, rational agents must carefully weigh the tradeoffs of advantageously exploiting their information to achieve a short-term gain versu...
Andrew Gilpin, Tuomas Sandholm