Sciweavers

2057 search results - page 196 / 412
» Scalable and Structured Scheduling
Sort
View
ESA
2008
Springer
130views Algorithms» more  ESA 2008»
13 years 9 months ago
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
Christian Bachmaier, Wolfgang Brunner
AIPS
1994
13 years 9 months ago
Solving Time-critical Decision-making Problems with Predictable Computational Demands
In this work we present an approach to solving time-critical decision-making problems by taking advantage of domain structure to expand the amountof time available for processing ...
Thomas Dean, Lloyd Greenwald
ICUMT
2009
13 years 5 months ago
Adaptive resource control in 2-hop ad-hoc networks
This paper presents a simple resource control mechanism with traffic scheduling for 2-hop ad-hoc networks, in which the Request-To-Send (RTS) packet is utilized to deliver feedback...
Yimeng Yang, Geert J. Heijenk, Boudewijn R. Haverk...
SEMWEB
2009
Springer
14 years 2 months ago
Parallelization and Distribution Techniques for Ontology Matching in Urban Computing Environments
The usage of parallelization and distribution techniques in the field of ontology matching is of high interest for the semantic web community. This work presents an approach for ma...
Axel Tenschert, Matthias Assel, Alexey Cheptsov, G...
ADC
2008
Springer
110views Database» more  ADC 2008»
14 years 2 months ago
Graph Mining based on a Data Partitioning Approach
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
Son N. Nguyen, Maria E. Orlowska, Xue Li