Sciweavers

2266 search results - page 347 / 454
» Generalizing parametric timing analysis
Sort
View
FOCS
2004
IEEE
14 years 2 months ago
Hardness of Approximating the Shortest Vector Problem in Lattices
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
Subhash Khot
ECMDAFA
2006
Springer
228views Hardware» more  ECMDAFA 2006»
14 years 2 months ago
Model Driven Development of Multi-Agent Systems
Abstract. Design patterns are templates of general solutions to commonlyoccurring problems in the analysis and design of software systems. In mature development processes, engineer...
Juan Pavón, Jorge J. Gómez-Sanz, Rub...
EMSOFT
2006
Springer
14 years 2 months ago
Real-time interfaces for composing real-time systems
Recently, a number of frameworks were proposed to extend interface theory to the domains of single-processor and distributed real-time systems. This paper unifies some of these ap...
Lothar Thiele, Ernesto Wandeler, Nikolay Stoimenov
GECCO
2006
Springer
144views Optimization» more  GECCO 2006»
14 years 2 months ago
Towards estimating nadir objective vector using evolutionary approaches
Nadir point plays an important role in multi-objective optimization because of its importance in estimating the range of objective values corresponding to desired Pareto-optimal s...
Kalyanmoy Deb, Shamik Chaudhuri, Kaisa Miettinen
PAKDD
2000
ACM
140views Data Mining» more  PAKDD 2000»
14 years 1 months ago
Performance Controlled Data Reduction for Knowledge Discovery in Distributed Databases
The objective of data reduction is to obtain a compact representation of a large data set to facilitate repeated use of non-redundant information with complex and slow learning alg...
Slobodan Vucetic, Zoran Obradovic