Sciweavers

2680 search results - page 213 / 536
» The topology of the independence complex
Sort
View
TJS
2008
78views more  TJS 2008»
15 years 1 months ago
A performance study of multiprocessor task scheduling algorithms
Abstract Multiprocessor task scheduling is an important and computationally difficult problem. A large number of algorithms were proposed which represent various tradeoffs between ...
Shiyuan Jin, Guy A. Schiavone, Damla Turgut
TOC
2008
89views more  TOC 2008»
15 years 1 months ago
Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols
Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....
Emanuele Viola, Avi Wigderson
INFORMATICALT
2002
140views more  INFORMATICALT 2002»
15 years 1 months ago
Intelligent Initial Finite Element Mesh Generation for Solutions of 2D Problems
The new strategy for non-uniform initial FE mesh generation is presented in this paper. The main focus is set to a priori procedures that define the sizing function independent on ...
Lina Vasiliauskiene, Romualdas Bausys
MOC
1998
88views more  MOC 1998»
15 years 1 months ago
A space efficient algorithm for group structure computation
We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order....
Edlyn Teske
RTAS
2010
IEEE
14 years 12 months ago
Scheduling Suspendable, Pipelined Tasks with Non-Preemptive Sections in Soft Real-Time Multiprocessor Systems
While most prior work on multiprocessor real-time scheduling focuses on independent tasks, dependencies due to non-preemptive sections, suspensions, and pipelinebased precedence c...
Cong Liu, James H. Anderson