Sciweavers

1392 search results - page 112 / 279
» Staging generic programming
Sort
View
ICALP
1998
Springer
14 years 1 months ago
Optimal Sampling Strategies in Quicksort
It is well known that the performance of quicksort can be improved by selecting the median of a sample of elements as the pivot of each partitioning stage. For large samples the pa...
Conrado Martínez, Salvador Roura
ICTL
1994
14 years 1 months ago
A Survey of Concurrent METATEM - the Language and its Applications
In this paper we present a survey of work relating to the Concurrent METATEM programming language. In addition to a description of the basic Concurrent METATEM system, which incorp...
Michael Fisher
CAIP
1995
Springer
155views Image Analysis» more  CAIP 1995»
14 years 21 days ago
A Proposal for the Implementation of a Parallel Watershed Algorithm
In this paper a parallel implementation of a watershed algorithm is proposed. The algorithm is designed for a ring-architecture with distributed memory and a piece of shared memory...
Arnold Meijster, Jos B. T. M. Roerdink
OOPSLA
2007
Springer
14 years 3 months ago
Component nextgen: a sound and expressive component framework for java
Developing a general component system for a statically typed, object-oriented language is a challenging design problem for two reasons. First, mutually recursive references across...
James Sasitorn, Robert Cartwright
CP
2005
Springer
14 years 2 months ago
Solving Over-Constrained Problems with SAT
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
Josep Argelich, Felip Manyà