Sciweavers

7941 search results - page 1222 / 1589
» Network Analysis of Repositories
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 7 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
WOSP
2005
ACM
16 years 10 days ago
From UML to LQN by XML algebra-based model transformations
The change of focus from code to models promoted by OMG's Model Driven Development raises the need for verification of nonfunctional characteristics of UML models, such as pe...
Gordon Ping Gu, Dorina C. Petriu
ICALP
1993
Springer
15 years 11 months ago
Exact Asymptotics of Divide-and-Conquer Recurrences
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
Philippe Flajolet, Mordecai J. Golin
ICPIA
1992
15 years 11 months ago
Intelligent Pattern Recognition and Applications
:: This talk deals with fundamental aspects of Intelligent Pattern Recognition (IPR) and applications. It basically includes the following: Overview of 3D Biometric Technology and ...
Patrick Shen-Pei Wang
ICSE
2000
IEEE-ACM
15 years 10 months ago
Software engineering and performance: a road-map
Software engineering has traditionally focussed on functional requirements and how to build software that has few bugs and can be easily maintained. Most design approaches include...
Rob Pooley
« Prev « First page 1222 / 1589 Last » Next »