Sciweavers

664 search results - page 87 / 133
» Solution to the Counterfeit Coin Problem and its Generalizat...
Sort
View
TIT
2010
130views Education» more  TIT 2010»
14 years 4 months ago
The power of convex relaxation: near-optimal matrix completion
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
Emmanuel J. Candès, Terence Tao
WCRE
2009
IEEE
15 years 4 months ago
Tracking Design Smells: Lessons from a Study of God Classes
—“God class” is a term used to describe a certain type of large classes which “know too much or do too much”. Often a God class (GC) is created by accident as functionali...
Stéphane Vaucher, Foutse Khomh, Naouel Moha...
ENC
2005
IEEE
15 years 3 months ago
Saving Evaluations in Differential Evolution for Constrained Optimization
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...
Efrén Mezura-Montes, Carlos A. Coello Coell...
EUROPAR
2003
Springer
15 years 3 months ago
Parallel ScaLAPACK-Style Algorithms for Solving Continuous-Time Sylvester Matrix Equations
An implementation of a parallel ScaLAPACK-style solver for the general Sylvester equation, op(A)X −Xop(B) = C, where op(A) denotes A or its transpose AT , is presented. The paral...
Robert Granat, Bo Kågström, Peter Porom...
AIPS
2000
14 years 11 months ago
Investigating the Effect of Relevance and Reachability Constraints on SAT Encodings of Planning
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
Minh Binh Do, Biplav Srivastava, Subbarao Kambhamp...