Sciweavers

6568 search results - page 1267 / 1314
» Reducing the Complexity of Reductions
Sort
View
KR
1992
Springer
15 years 10 months ago
Intelligent Backtracking Techniques for Job Shop Scheduling
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...
Yalin Xiong, Norman M. Sadeh, Katia P. Sycara
FP
1989
124views Formal Methods» more  FP 1989»
15 years 10 months ago
Deriving the Fast Fourier Algorithm by Calculation
This paper reports an explanation of an intricate algorithm in the terms of a potentially mechanisable rigorous-development method. It uses notations and techniques of Sheeran 1] ...
Geraint Jones
ACMSE
2007
ACM
15 years 10 months ago
Verifying design modularity, hierarchy, and interaction locality using data clustering techniques
Modularity, hierarchy, and interaction locality are general approaches to reducing the complexity of any large system. A widely used principle in achieving these goals in designin...
Liguo Yu, Srini Ramaswamy
DIAGRAMS
2010
Springer
15 years 10 months ago
Drawing Area-Proportional Venn-3 Diagrams with Convex Polygons
Abstract. Area-proportional Venn diagrams are a popular way of visualizing the relationships between data sets, where the set intersections have a specified numerical value. In th...
Peter Rodgers, Jean Flower, Gem Stapleton, John Ho...
GFKL
2007
Springer
163views Data Mining» more  GFKL 2007»
15 years 10 months ago
Fast Support Vector Machine Classification of Very Large Datasets
In many classification applications, Support Vector Machines (SVMs) have proven to be highly performing and easy to handle classifiers with very good generalization abilities. Howe...
Janis Fehr, Karina Zapien Arreola, Hans Burkhardt
« Prev « First page 1267 / 1314 Last » Next »