Sciweavers

3136 search results - page 532 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
CSDA
2007
109views more  CSDA 2007»
15 years 5 months ago
Improving the computation of censored quantile regressions
Abstract. Censored quantile regressions (CQR) are a valuable tool in economics and engineering. The computation of estimators is highly complex and the performance of standard meth...
Bernd Fitzenberger, Peter Winker
JGAA
2006
69views more  JGAA 2006»
15 years 5 months ago
Efficient drawing of RNA secondary structure
In this paper, we propose a new layout algorithm that draws the secondary structure of a Ribonucleic Acid (RNA) automatically according to some of the biologists' aesthetic c...
David Auber, Maylis Delest, Jean-Philippe Domenger...
149
Voted
LISP
2008
104views more  LISP 2008»
15 years 5 months ago
Flattening tuples in an SSA intermediate representation
For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequ...
Lukasz Ziarek, Stephen Weeks, Suresh Jagannathan
JSAT
2006
114views more  JSAT 2006»
15 years 5 months ago
Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...
Miguel F. Anjos
NCA
2008
IEEE
15 years 5 months ago
Neurodynamic programming: a case study of the traveling salesman problem
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
Jia Ma, Tao Yang, Zeng-Guang Hou, Min Tan, Derong ...