Sciweavers

1071 search results - page 70 / 215
» Programming with enumerable sets of structures
Sort
View
NETWORKS
2008
14 years 11 months ago
Lower bounds for two-period grooming via linear programming duality
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
CN
1998
105views more  CN 1998»
14 years 10 months ago
WebL - A Programming Language for the Web
In this paper we introduce a programming language for Web document processing called WebL. WebL is a high level, object-oriented scripting language that incorporates two novel fea...
Thomas Kistler, Hannes Marais
ISMB
1996
15 years 10 days ago
Finding Genes in DNA Using Decision Trees and Dynamic Programming
This study demonstratesthe use of decision tree classifiers as the basis for a general gene-finding system. The system uses a dynamic programmingalgorithm that. finds the optimal ...
Steven Salzberg, Xin Chen, John Henderson, Kenneth...
TSE
2010
151views more  TSE 2010»
14 years 9 months ago
The Probabilistic Program Dependence Graph and Its Application to Fault Diagnosis
This paper presents an innovative model of a program’s internal behavior over a set of test inputs, called the probabilistic program dependence graph (PPDG), that facilitates pr...
George K. Baah, Andy Podgurski, Mary Jean Harrold
EOR
2006
148views more  EOR 2006»
14 years 11 months ago
Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection
One of the most important, common and critical management issues lies in determining the "best" project portfolio out of a given set of investment proposals. As this dec...
Karl F. Doerner, Walter J. Gutjahr, Richard F. Har...