Sciweavers

697 search results - page 123 / 140
» A Study of Evaluation Functions for the Graph K-Coloring Pro...
Sort
View
ORL
1998
68views more  ORL 1998»
13 years 7 months ago
A fast bipartite network flow algorithm for selective assembly
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick
ICSE
2004
IEEE-ACM
14 years 7 months ago
Skoll: Distributed Continuous Quality Assurance
Quality assurance (QA) tasks, such as testing, profiling, and performance evaluation, have historically been done in-house on developer-generated workloads and regression suites. ...
Atif M. Memon, Adam A. Porter, Cemal Yilmaz, Adith...
ECAL
1995
Springer
13 years 11 months ago
Can Development Be Designed? What we May Learn from the Cog Project
Neither `design' nor `evolutionary' approaches to building behavior-based robots feature a role for development in the genesis of behavioral organization. However, the n...
Julie C. Rutkowska
SIGIR
2010
ACM
13 years 7 months ago
Optimal meta search results clustering
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...
Claudio Carpineto, Giovanni Romano
CVPR
2008
IEEE
14 years 9 months ago
A unified framework for generalized Linear Discriminant Analysis
Linear Discriminant Analysis (LDA) is one of the wellknown methods for supervised dimensionality reduction. Over the years, many LDA-based algorithms have been developed to cope w...
Shuiwang Ji, Jieping Ye