Sciweavers

2370 search results - page 305 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
DAM
2007
100views more  DAM 2007»
14 years 10 months ago
Partially ordered knapsack and applications to scheduling
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
Stavros G. Kolliopoulos, George Steiner
JLP
2006
108views more  JLP 2006»
14 years 10 months ago
On testing UML statecharts
We present a formal framework for notions related to testing and model based test generation for a behavioural subset of UML Statecharts (UMLSCs). This framework builds, on one ha...
Mieke Massink, Diego Latella, Stefania Gnesi
ML
2006
ACM
163views Machine Learning» more  ML 2006»
14 years 10 months ago
Extremely randomized trees
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
Pierre Geurts, Damien Ernst, Louis Wehenkel
PR
2006
84views more  PR 2006»
14 years 10 months ago
Clustering techniques for protein surfaces
Though most approaches to protein comparison are based on their structure, several studies produced evidence of a strict correlation between the surface characteristics of protein...
Lorenzo Baldacci, Matteo Golfarelli, Alessandra Lu...
SIAMJO
2008
114views more  SIAMJO 2008»
14 years 10 months ago
An Inexact SQP Method for Equality Constrained Optimization
We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that ca...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal