Sciweavers

7342 search results - page 854 / 1469
» Optimal Language Learning
Sort
View
CP
2003
Springer
16 years 20 days ago
Using Constraint Programming to Solve the Maximum Clique Problem
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
Jean-Charles Régin
GECCO
2003
Springer
111views Optimization» more  GECCO 2003»
16 years 20 days ago
Evolutionary Computing as a Tool for Grammar Development
Abstract. In this paper, an agent-based evolutionary computing technique is introduced, that is geared towards the automatic induction and optimization of grammars for natural lang...
Guy De Pauw
DATE
2002
IEEE
73views Hardware» more  DATE 2002»
16 years 12 days ago
A Burst-Mode Oriented Back-End for the Balsa Synthesis System
This paper introduces several new component clustering techniques for the optimization of asynchronous systems. In particular, novel “Burst-Mode aware” restrictions are impose...
Tiberiu Chelcea, Steven M. Nowick, Andrew Bardsley...
ICPP
1998
IEEE
15 years 11 months ago
Minimizing Data and Synchronization Costs in One-Way Communication
In contrast to the conventional send/receive model, the one-way communication model--using Put and Synch--allows the decoupling of message transmission from synchronization. This ...
Mahmut T. Kandemir, U. Nagaraj Shenoy, Prithviraj ...
FOCS
1990
IEEE
15 years 11 months ago
Uniform Memory Hierarchies
We present several e cient algorithms for sorting on the uniform memory hierarchy UMH, introduced by Alpern, Carter, and Feig, and its parallelization P-UMH. We give optimal and ne...
Bowen Alpern, Larry Carter, Ephraim Feig