Sciweavers

7557 search results - page 1455 / 1512
» Modeling Timed Concurrent Systems
Sort
View
SPAA
2004
ACM
15 years 5 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
SIGUCCS
2003
ACM
15 years 5 months ago
Student staff: n. an energetic, brilliant, creative, talented potential rolled into a food-driven, sleep-deprived, unmotivated c
Students are a wonderful resource for any department of a college or university, especially an ITS department. They are inexpensive and abundant. They want to work at strange time...
Karen McRitchie
FATES
2003
Springer
15 years 5 months ago
JMLAutoTest: A Novel Automated Testing Framework Based on JML and JUnit
Abstract. Writing specifications using Java Modeling Language has been accepted for a long time as a practical approach to increasing the correctness and quality of Java programs. ...
Guoqing Xu, Zongyuang Yang
COMPGEOM
2010
ACM
15 years 5 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
NEUROSCIENCE
2001
Springer
15 years 4 months ago
Analysis and Synthesis of Agents That Learn from Distributed Dynamic Data Sources
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
Doina Caragea, Adrian Silvescu, Vasant Honavar
« Prev « First page 1455 / 1512 Last » Next »