We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.

Search Results

Showing 61-80 of 175 results
  1. Multiplayer quantum games and its application as access controller in architecture of quantum computers

    One of the basics tasks in computer systems is the control of access of resources. Basically, there is a finite amount of resources that can be, for...

    Paulo Benicio Melo de Sousa, Rubens Viana Ramos in Quantum Information Processing
    Article 26 June 2008
  2. An approach for solving a modification of the extended rapid transit network design problem

    In this paper we deal with a slight modification of the extended rapid transit network design problem to allow circular lines. A two-stage approach...

    L. F. Escudero, S. Muñoz in TOP
    Article 06 September 2008
  3. Eliciting vague but proper maximal entropy priors in Bayesian experiments

    Priors elicited according to maximal entropy rules have been used for years in objective and subjective Bayesian analysis. However, when the prior...

    Nicolas Bousquet in Statistical Papers
    Article 14 June 2008
  4. Two local dissimilarity measures for weighted graphs with application to protein interaction networks

    We extend the Czekanowski-Dice dissimilarity measure, classically used to cluster the vertices of unweighted graphs, to weighted ones. The first...

    Jean-Baptiste Angelelli, Anaïs Baudot, ... Alain Guénoche in Advances in Data Analysis and Classification
    Article 13 March 2008
  5. Community Structures of Networks

    We present an approach to studying the community structures of networks by using linear programming (LP). Starting with a network in terms of (a) a...

    William Y. C. Chen, Andreas W. M. Dress, Winking Q. Yu in Mathematics in Computer Science
    Article Open access 05 March 2008
  6. The traveling salesman problem: a book review

    We review the recent book authored by David L. Applegate, Robert E. Bixby, Vasěk Chvátal and William J. Cook, The traveling salesman problem: a...

    Adam N. Letchford, Andrea Lodi in 4OR
    Article 17 October 2007
  7. Optimization of modular machining lines

    The paper summarizes the main results of the author’s Ph.D. thesis presented in December 2006 at the École des Mines de Saint Étienne. The work was...

    Sana Belmokhtar in 4OR
    Article 17 October 2007
  8. Zwei auf einen Streich: Optimierte dynamische Einsatzplanung für Gelbe Engel und Lastenaufzüge

    We present a unified model for two dynamic dispatching problems: the dynamic dispatching of automobile service vehicles at the German Automobile...
    Jörg Rambau, Cornelius Schwarz in Die Kunst des Modellierens
    Chapter 2008
  9. Distributed multirobot exploration, map**, and task allocation

    We present an integrated approach to multirobot exploration, map** and searching suitable for large teams of robots operating in unknown areas...

    Regis Vincent, Dieter Fox, ... Benjamin Stewart in Annals of Mathematics and Artificial Intelligence
    Article 01 April 2008
  10. Computational experiments with a lazy version of a K quickest simple path ranking algorithm

    The quickest path problem is related to the classical shortest path problem, but its objective function concerns the transmission time of a given...

    M. Pascoal, M. E. Captivo, J. C. Clímaco in TOP
    Article 11 October 2007
  11. An extension to rapid transit network design problem

    The rapid transit network design problem consists of the location of train alignments and stations, in a context where the demand makes its own...

    Ángel Marín in TOP
    Article 10 July 2007
  12. Median problems on wheels and cactus graphs

    This paper is dedicated to location problems on graphs. We propose a linear time algorithm for the 1-median problem on wheel graphs. Moreover, some...

    J. Hatzl in Computing
    Article 30 July 2007
  13. Combinatorial optimization and Green Logistics

    The purpose of this paper is to introduce the area of Green Logistics and to describe some of the problems that arise in this subject which can be...

    Abdelkader Sbihi, Richard W. Eglese in 4OR
    Article 01 June 2007
  14. A simple GAP-canceling algorithm for the generalized maximum flow problem

    We give a simple primal algorithm for the generalized maximum flow problem that repeatedly finds and cancels generalized augmenting paths (GAPs). We...

    Mateo Restrepo, David P. Williamson in Mathematical Programming
    Article 14 August 2007
  15. Vehicle and personnel routing optimization in the service sector: application to water distribution and treatment

    We present an overview of the author’s Ph.D. thesis, supervised by P. Dejax and N. Bostel, which was defended in February 2006 at École des Mines de...

    Fabien Tricoire in 4OR
    Article 13 October 2006
  16. Inverse minimum flow problem

    In this paper we consider the inverse minimum flow (ImF) problem, where lower and upper bounds for the flow must be changed as little as possible so...

    Eleonor Ciurea, Adrian Deaconu in Journal of Applied Mathematics and Computing
    Article 01 January 2007
  17. Thek-centrum shortest path problem

    The k -Centrum Shortest Path Problem ( kCSP[s, t] ) is to minimize the sum of the k longest arcs in any (simple) s−t path containing at least k arcs, where k ...

    Robert Garfinkel, Elena Fernández, Timothy J. Lowe in TOP
    Article 01 December 2006
  18. On the Edge-forwarding Indices of Frobenius Graphs

    A G -Frobenius graph Γ, as defined by Fang, Li, and Praeger, is a connected orbital graph of a Frobenius group G = K H with Frobenius kernel K and...

    Yan Wang, **n Gui Fang, D. F. Hsu in Acta Mathematica Sinica
    Article 22 September 2006
  19. Theory of semidefinite programming for Sensor Network Localization

    We analyze the semidefinite programming (SDP) based model and method for the position estimation problem in sensor network localization and other...

    Anthony Man-Cho So, Yinyu Ye in Mathematical Programming
    Article 19 September 2006
  20. Complex Networks: from Graph Theory to Biology

    The aim of this text is to show the central role played by networks in complex system science. A remarkable feature of network studies is to lie at...

    Article 22 November 2006
Did you find what you were looking for? Share feedback.