Sciweavers

5065 search results - page 274 / 1013
» Neural networks: Algorithms and applications
Sort
View
IPPS
2009
IEEE
16 years 1 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...
IADIS
2004
15 years 8 months ago
Collaborative Task Scheduling Method Based on Social Network Analysis for Cellphone Application
This paper proposes a collaborative approach for personal task management which is modeled as an alliance model. Alliance model is based on information sharing and collaboration o...
Ikki Ohmukai, Hideaki Takeda
PPOPP
2010
ACM
16 years 1 months ago
Thread to strand binding of parallel network applications in massive multi-threaded systems
In processors with several levels of hardware resource sharing, like CMPs in which each core is an SMT, the scheduling process becomes more complex than in processors with a singl...
Petar Radojkovic, Vladimir Cakarevic, Javier Verd&...
ICANN
2007
Springer
16 years 1 months ago
Identifying Binding Sites in Sequential Genomic Data
The identification of cis-regulatory binding sites in DNA is a difficult problem in computational biology. To obtain a full understanding of the complex machinery embodied in genet...
Mark Robinson, Cristina González Castellano...
NGC
2001
Springer
196views Communications» more  NGC 2001»
15 years 11 months ago
Application-Level Multicast Using Content-Addressable Networks
Abstract. Most currently proposed solutions to application-level multicast organize the group members into an application-level mesh over which a DistanceVector routing protocol, o...
Sylvia Ratnasamy, Mark Handley, Richard M. Karp, S...