Sciweavers

4117 search results - page 227 / 824
» On the Satisfiability of Complex Constraints
Sort
View
TSP
2008
99views more  TSP 2008»
15 years 6 months ago
Sphere Decoding With a Probabilistic Tree Pruning
In this paper, we present a near ML-achieving sphere decoding algorithm that reduces the number of search operations in the sphere-constrained search. Specifically, by adding a pro...
Byonghyo Shim, Insung Kang
MOBICOM
2005
ACM
16 years 5 days ago
An analytical model for the dimensioning of a GPRS/EDGE network with a capacity constraint on a group of cells
This paper is a contribution to the generic problem of having simple and accurate models to dimension radio cells with data traffic on a GPRS or EDGE network. It addresses the iss...
Georges Nogueira, Bruno Baynat, Pierre Eisenmann
SIAMSC
2008
179views more  SIAMSC 2008»
15 years 6 months ago
Multigrid Algorithms for Inverse Problems with Linear Parabolic PDE Constraints
Abstract. We present a multigrid algorithm for the solution of distributed parameter inverse problems constrained by variable-coefficient linear parabolic partial differential equa...
Santi S. Adavani, George Biros
TOPLAS
2008
81views more  TOPLAS 2008»
15 years 6 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
GECCO
2007
Springer
258views Optimization» more  GECCO 2007»
16 years 24 days ago
A genetic algorithm for resident physician scheduling problem
This paper formally presents the resident physician scheduling problem, which is one of the most important scheduling problems in hospital. The resident physician scheduling probl...
Chi-Way Wang, Lei-Ming Sun, Ming-Hui Jin, Chung-Ju...