Sciweavers

6740 search results - page 1220 / 1348
» Using Classification as a Programming Language
Sort
View
ICALP
2003
Springer
15 years 10 months ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper
ICALP
2003
Springer
15 years 10 months ago
A Direct Sum Theorem in Communication Complexity via Message Compression
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
IFIP
2003
Springer
15 years 9 months ago
A Service Discovery Model for Wireless and Mobile Terminals in IPv6
As the mobility and the number of affordable, powerful, and highly portable devices becoming networked increases, so will the amount of networked services offered, managed and disc...
Bilhanan Silverajan, Jaakko Kalliosalo, Jarmo Harj...
SPAA
2009
ACM
15 years 9 months ago
Brief announcement: a lower bound for depth-restricted work stealing
Work stealing is a common technique used in the runtime schedulers of parallel languages such as Cilk and parallel libraries such as Intel Threading Building Blocks (TBB). Depth-r...
Jim Sukha
ADAEUROPE
2001
Springer
15 years 9 months ago
Transaction Support for Ada
This paper describes the transaction support framework OPTIMA and its implementation for Ada 95. First, a transaction model that fits concurrent programming languages is presented...
Jörg Kienzle, Ricardo Jiménez-Peris, A...
« Prev « First page 1220 / 1348 Last » Next »