Sciweavers

1429 search results - page 118 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
SISAP
2008
IEEE
175views Data Mining» more  SISAP 2008»
14 years 3 months ago
Anytime K-Nearest Neighbor Search for Database Applications
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
Weijia Xu, Daniel P. Miranker, Rui Mao, Smriti R. ...
GECCO
2005
Springer
107views Optimization» more  GECCO 2005»
14 years 2 months ago
Minimum spanning trees made easier via multi-objective optimization
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
Frank Neumann, Ingo Wegener
COOPIS
2002
IEEE
14 years 2 months ago
Composing and Deploying Grid Middleware Web Services Using Model Driven Architecture
Rapid advances in networking, hardware, and middleware technologies are facilitating the development and deployment of complex grid applications, such as large-scale distributed co...
Aniruddha S. Gokhale, Balachandran Natarajan
CHARME
1997
Springer
105views Hardware» more  CHARME 1997»
14 years 22 days ago
Simulation-based verification of network protocols performance
Formal verification techniques need to deal with the complexity of the systems rified. Most often, this problem is solved by taking an abstract model of the system and aiming at a...
Mario Baldi, Fulvio Corno, Maurizio Rebaudengo, Pa...
IJCNN
2007
IEEE
14 years 3 months ago
Search Strategies Guided by the Evidence for the Selection of Basis Functions in Regression
— This work addresses the problem of selecting a subset of basis functions for a model linear in the parameters for regression tasks. Basis functions from a set of candidates are...
Ignacio Barrio, Enrique Romero, Lluís Belan...