Sciweavers

3818 search results - page 236 / 764
» Word Problems on Compressed Words
Sort
View
SIAMJO
2002
124views more  SIAMJO 2002»
15 years 6 months ago
The Sample Average Approximation Method for Stochastic Discrete Optimization
In this paper we study a Monte Carlo simulation based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and...
Anton J. Kleywegt, Alexander Shapiro, Tito Homem-d...
COMCOM
2010
246views more  COMCOM 2010»
15 years 5 months ago
Tabu search algorithm for RP selection in PIM-SM multicast routing
: - To construct a multicast tree is the basis of multicast data transmission. The prime problem concerning the construction of a shared multicast tree is to determine the position...
Hua Wang, Xiangxu Meng, Min Zhang, Yanlong Li
CP
2010
Springer
15 years 5 months ago
Testing Expressibility Is Hard
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
Ross Willard
KBS
2007
56views more  KBS 2007»
15 years 6 months ago
Domain-dependent distributed models for railway scheduling
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
Miguel A. Salido, Montserrat Abril, Federico Barbe...
NAACL
2003
15 years 8 months ago
TAP-XL: An Automated Analyst's Assistant
The TAP-XL Automated Analyst’s Assistant is an application designed to help an Englishspeaking analyst write a topical report, culling information from a large inflow of multili...
Sean Colbath, Francis Kubala