Sciweavers

13987 search results - page 691 / 2798
» The Two Guards Problem
Sort
View
EOR
2007
100views more  EOR 2007»
15 years 7 months ago
Parallel radial basis function methods for the global optimization of expensive functions
We introduce a master–worker framework for parallel global optimization of computationally expensive functions using response surface models. In particular, we parallelize two r...
Rommel G. Regis, Christine A. Shoemaker
HYBRID
2010
Springer
16 years 2 months ago
Real-time scheduling of mixture-of-experts systems with limited resources
Mixture-of-Experts (MoE) systems solve intricate problems by combining results generated independently by multiple computational models (the “experts”). Given an instance of a...
Prapaporn Rattanatamrong, José A. B. Fortes
ICSM
2009
IEEE
16 years 2 months ago
A combinatorial approach to building navigation graphs for dynamic web applications
Modeling the navigation structure of a dynamic web application is a challenging task because of the presence of dynamic pages. In particular, there are two problems to be dealt wi...
Wenhua Wang, Yu Lei, Sreedevi Sampath, Raghu Kacke...
ICS
2005
Tsinghua U.
16 years 29 days ago
Continuous Replica Placement schemes in distributed systems
The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RP...
Thanasis Loukopoulos, Petros Lampsas, Ishfaq Ahmad
ICALP
2010
Springer
16 years 9 days ago
On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
Amir Shpilka, Ilya Volkovich