Sciweavers

5169 search results - page 650 / 1034
» Locality approximation using time
Sort
View
159
Voted
HEURISTICS
2007
165views more  HEURISTICS 2007»
15 years 6 months ago
New heuristics for the maximum diversity problem
Abstract. The Maximum Diversity Problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...
Geiza C. Silva, Marcos R. Q. de Andrade, Luiz Sato...
QUESTA
2006
87views more  QUESTA 2006»
15 years 6 months ago
Some universal limits for nonhomogeneous birth and death processes
In this paper we consider nonhomogeneous birth and death processes (BDP) with periodic rates. Two important parameters are studied, which are helpful to describe a nonhomogeneous B...
Alexander I. Zeifman, S. Leorato, E. Orsingher, Ya...
175
Voted
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
15 years 6 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof
AMAI
1999
Springer
15 years 6 months ago
Pattern recognition by an optical thin-film multilayer model
This paper describes a computational learning model inspired by the technology of optical thin-film multilayers from the field of optics. With the thicknesses of thin-film layers ...
Xiaodong Li, Martin K. Purvis
COR
2008
131views more  COR 2008»
15 years 5 months ago
Queueing analysis of a server node in transaction processing middleware systems
Quantitative performance modeling of complex information systems is of immense importance for designing enterprise e-business infrastructures and applications. In this paper, we p...
Wei Xiong, Tayfur Altiok