Sciweavers

4797 search results - page 16 / 960
» The complexity of partition tasks
Sort
View
LREC
2008
109views Education» more  LREC 2008»
13 years 9 months ago
The Italian Particle "ne": Corpus Construction and Analysis
The Italian particle ne exhibits interesting anaphoric properties that have not been yet explored in depth from a corpus and computational linguistic perspective. We provide: (i) ...
Malvina Nissim, Sara Perboni
EMSOFT
2009
Springer
14 years 2 months ago
Cache-aware scheduling and analysis for multicores
The major obstacle to use multicores for real-time applications is that we may not predict and provide any guarantee on real-time properties of embedded software on such platforms...
Nan Guan, Martin Stigge, Wang Yi, Ge Yu
RTAS
2011
IEEE
12 years 11 months ago
A Lookup-Table Driven Approach to Partitioned Scheduling
The partitioned preemptive EDF scheduling of implicitdeadline sporadic task systems on an identical multiprocessor platform is considered. Lookup tables, at any selected degree of...
Bipasa Chattopadhyay, Sanjoy K. Baruah
IJDSN
2008
81views more  IJDSN 2008»
13 years 7 months ago
A Flexible Stochastic Automaton-Based Algorithm for Network Self-Partitioning
This article proposes a flexible and distributed stochastic automaton-based network partitioning algorithm that is capable of finding the optimal k-way partition with respect to a...
Yan Wan, Sandip Roy, Ali Saberi, Bernard C. Lesieu...
ICSOC
2005
Springer
14 years 1 months ago
Handling Faults in Decentralized Orchestration of Composite Web Services
Abstract. Composite web services can be orchestrated in a decentralized manner by breaking down the original service specification into a set of partitions and executing them on a...
Girish Chafle, Sunil Chandra, Pankaj Kankar, Vijay...