Sciweavers

1368 search results - page 271 / 274
» Generalized Rook Polynomials
Sort
View
ORL
1998
116views more  ORL 1998»
13 years 6 months ago
Heuristic solution of the multisource Weber problem as a p-median problem
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
Pierre Hansen, Nenad Mladenovic, Éric D. Ta...
SCHEDULING
2008
89views more  SCHEDULING 2008»
13 years 6 months ago
Batch scheduling of step deteriorating jobs
In this paper we consider the problem of scheduling n jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a step function depe...
M. S. Barketau, T. C. Edwin Cheng, C. T. Ng, Vladi...
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
13 years 5 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
INFOCOM
2010
IEEE
13 years 5 months ago
Network Coding Tomography for Network Failures
—Network Tomography (or network monitoring) uses end-to-end path-level measurements to characterize the network, such as topology estimation and failure detection. This work prov...
Hongyi Yao, Sidharth Jaggi, Minghua Chen
INFOCOM
2010
IEEE
13 years 5 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...