Sciweavers

3142 search results - page 426 / 629
» Solving Hierarchical Optimization Problems Using MOEAs
Sort
View
105
Voted
CLUSTER
2002
IEEE
15 years 5 months ago
Algorithmic Mechanism Design for Load Balancing in Distributed Systems
Computational Grids are large scale computing system composed of geographically distributed resources (computers, storage etc.) owned by self interested agents or organizations. T...
Daniel Grosu, Anthony T. Chronopoulos
106
Voted
ASPDAC
2008
ACM
69views Hardware» more  ASPDAC 2008»
15 years 2 months ago
Fast, quasi-optimal, and pipelined instruction-set extensions
Nowadays many customised embedded processors offer the possibility of speeding up an application by implementing it using Application-Specific Functional units (AFUs). However, th...
Ajay K. Verma, Philip Brisk, Paolo Ienne
84
Voted
CONEXT
2008
ACM
15 years 2 months ago
ISP-friendly peer matching without ISP collaboration
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...
Cheng-Hsin Hsu, Mohamed Hefeeda
109
Voted
BIODATAMINING
2008
85views more  BIODATAMINING 2008»
15 years 19 days ago
A review of estimation of distribution algorithms in bioinformatics
Evolutionary search algorithms have become an essential asset in the algorithmic toolbox for solving high-dimensional optimization problems in across a broad range of bioinformati...
Rubén Armañanzas, Iñaki Inza,...
112
Voted
DM
2010
90views more  DM 2010»
15 years 18 days ago
Knights, spies, games and ballot sequences
This paper solves the Knights and Spies Problem: In a room there are n people, each labelled with a unique number between 1 and n. A person may either be a knight or a spy. Knights...
Mark Wildon