1732 search results - page 9 / 347 » New Challenges in Parallel Optimization |
153
Voted
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
Buffered coscheduling is a scheduling methodology for time-sharing communicating processes in parallel and distributed systems. The methodology has two primary features: communica...
172
click to vote
DLOG
2010
15 years 4 months ago
2010
Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emer...
207
Voted
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emer...
176
Voted
LCPC
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. As parallelism in microprocessors becomes mainstream, new programming languages and environments are emerging to meet the challenges of parallel programming. To support r...
176
click to vote
ICS
1995
Tsinghua U.
15 years 10 months ago
1995
Tsinghua U.
In this paper we give a new run–time technique for finding an optimal parallel execution schedule for a partially parallel loop, i.e., a loop whose parallelization requires syn...