Sciweavers

1006 search results - page 95 / 202
» Clustering of Software Systems Using New Hybrid Algorithms
Sort
View
CASES
2010
ACM
13 years 8 months ago
Real-time unobtrusive program execution trace compression using branch predictor events
Unobtrusive capturing of program execution traces in real-time is crucial in debugging cyber-physical systems. However, tracing even limited program segments is often cost-prohibi...
Vladimir Uzelac, Aleksandar Milenkovic, Martin Bur...
CORR
2011
Springer
206views Education» more  CORR 2011»
13 years 5 months ago
Arrangement Computation for Planar Algebraic Curves
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decompos...
Eric Berberich, Pavel Emeliyanenko, Alexander Kobe...
SCHOLARPEDIA
2011
13 years 28 days ago
N-body simulations
Abstract. Scientists’ ability to generate and collect massive-scale datasets is increasing. As a result, constraints in data analysis capability rather than limitations in the av...
CLUSTER
2005
IEEE
14 years 3 months ago
Search-based Job Scheduling for Parallel Computer Workloads
To balance performance goals and allow administrators to declaratively specify high-level performance goals, we apply complete search algorithms to design on-line job scheduling p...
Sangsuree Vasupongayya, Su-Hui Chiang, B. Massey
IPPS
1998
IEEE
14 years 2 months ago
Fault-Tolerant Message Routing for Multiprocessors
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
Lev Zakrevski, Mark G. Karpovsky