Sciweavers

8496 search results - page 243 / 1700
» Problem Solving and Complex Systems
Sort
View
131
Voted
CISS
2008
IEEE
15 years 9 months ago
Distributed processing in frames for sparse approximation
—Beyond signal processing applications, frames are also powerful tools for modeling the sensing and information processing of many biological and man-made systems that exhibit in...
Christopher J. Rozell
135
Voted
ICRA
2005
IEEE
174views Robotics» more  ICRA 2005»
15 years 8 months ago
Fast Implementation of Lemke's Algorithm for Rigid Body Contact Simulation
— We present a fast method for solving rigid body contact problems with friction, based on optimizations incorporated into Lemke’s algorithm for solving linear complementarity ...
John E. Lloyd
COMPGEOM
1994
ACM
15 years 6 months ago
Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions
We consider the problem of bounding the combinatorial complexity of a single cell in an arrangement of n low-degree algebraic surface patches in 3-space. We show that this complex...
Dan Halperin, Micha Sharir
ICAC
2005
IEEE
15 years 8 months ago
Quickly Finding Known Software Problems via Automated Symptom Matching
We present an architecture for and prototype of a system for quickly detecting software problem recurrences. Re-discovery of the same problem is very common in many large software...
Mark Brodie, Sheng Ma, Guy M. Lohman, Laurent Mign...
118
Voted
FGCS
2000
83views more  FGCS 2000»
15 years 2 months ago
A Graph-based Ant System and its convergence
: A general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. The framework is based on the concept of a construction...
Walter J. Gutjahr