Sciweavers

16257 search results - page 135 / 3252
» D-finiteness: algorithms and applications
Sort
View
COMPGEOM
2011
ACM
14 years 1 months ago
On the structure and composition of forbidden sequences, with geometric applications
Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...
Seth Pettie
JUCS
2006
95views more  JUCS 2006»
14 years 10 months ago
POCA : A User Distributions Algorithm in Enterprise Systems with Clustering
Abstract: As enterprises worldwide race to improve real-time management to improve productivity, customer services and flexibility, huge resources have been invested into enterpris...
Ping-Yu Hsu, Ping-Ho Ting
JSSPP
2005
Springer
15 years 3 months ago
Enhancing Security of Real-Time Applications on Grids Through Dynamic Scheduling
Real-time applications with security requirements are emerging in various areas including government, education, and business. The security sensitive real-time applications can ta...
Tao Xie 0004, Xiao Qin
GRID
2006
Springer
14 years 10 months ago
A Decentralized Computational Infrastructure for Grid-Based Parallel Asynchronous Iterative Applications
Abstract Parallel asynchronous iterative algorithms relax synchronization and communication requirements, and can potentially extend Desktop Grids beyond embarrassingly parallel ap...
Zhen Li, Manish Parashar
IPPS
2006
IEEE
15 years 4 months ago
Using virtual grids to simplify application scheduling
Users and developers of grid applications have access to increasing numbers of resources. While more resources generally mean higher capabilities for an application, they also rai...
Richard Y. Huang, Henri Casanova, Andrew A. Chien