Sciweavers

1101 search results - page 32 / 221
» Comparing Computer Models Solving Number Series Problems
Sort
View
ICCSA
2010
Springer
14 years 11 months ago
Efficient Algorithms for the 2-Center Problems
This paper achieves O(n3 log log n/ log n) time for the 2center problems on a directed graph with non-negative edge costs under the conventional RAM model where only arithmetic ope...
Tadao Takaoka
AIPS
2011
14 years 1 months ago
Searching for Plans with Carefully Designed Probes
We define a probe to be a single action sequence computed greedily from a given state that either terminates in the goal or fails. We show that by designing these probes carefull...
Nir Lipovetzky, Hector Geffner
JMLR
2010
162views more  JMLR 2010»
14 years 4 months ago
A Surrogate Modeling and Adaptive Sampling Toolbox for Computer Based Design
An exceedingly large number of scientific and engineering fields are confronted with the need for computer simulations to study complex, real world phenomena or solve challenging ...
Dirk Gorissen, Ivo Couckuyt, Piet Demeester, Tom D...
EOR
2007
75views more  EOR 2007»
14 years 9 months ago
Improved modeling and solution methods for the multi-resource routing problem
This paper presents modeling and solution method improvements for the Multi-Resource Routing Problem (MRRP) with flexible tasks. The MRRP with flexible tasks is used to model ro...
Peter Francis, Guangming Zhang, Karen R. Smilowitz
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
14 years 13 days ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...