Search for dissertations about: "combinatorial allocation"

Showing result 1 - 5 of 21 swedish dissertations containing the words combinatorial allocation.

2. 1. Combinatorial Optimization : Three Applications

   Author : Efraim Laksman; Blekinge Tekniska Högskola; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES;

   Abstract : Combinatorial optimization is a diverse area of mathematics. It concerns optimization on feasible regions defined by discrete sets, graphs, hypergraphs, matroids, etc. . . READ MORE

4. 2. Bidding in Combinatorial Auctions

   Author : Jim Wilenius; Arne Andersson; Peter Bro Miltersen; Uppsala universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; combinatorial auction; multiple-object; first-price; sealed-bid; game theory; multiple items; simultaneous auction; integer programming; equilibrium; strategy; reveue; Information technology; Informationsteknik; Datavetenskap; Computer Science;

   Abstract : This thesis concerns the interdisciplinary field of combinatorial auctions, combining the fields of computer science, optimization and economics. A combinatorial auction is an auction where many items are sold simultaneously and where bidders may submit indivisible combinatorial bids on groups of items. READ MORE

5. 3. Constraint-Based Register Allocation and Instruction Scheduling

   Author : Roberto Castañeda Lozano; Christian Schulte; Ingo Sander; Mats Carlsson; Laurent Michel; KTH; []
   Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; constraint programming; combinatorial optimization; register allocation; instruction scheduling; compiler construction; Informations- och kommunikationsteknik; Information and Communication Technology;

   Abstract : Register allocation (mapping variables to processor registers or memory) and instruction scheduling (reordering instructions to improve latency or throughput) are central compiler problems. This dissertation proposes a combinatorial optimization approach to these problems that delivers optimal solutions according to a model, captures trade-offs between conflicting decisions, accommodates processor-specific features, and handles different optimization criteria. READ MORE

6. 4. Analysis of Algorithms for Combinatorial Auctions and Related Problems

   Author : Kidane Asrat Ghebreamlak; Svante Janson; Arne Andersson; Anders Johansson; Uppsala universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; combinatorial auctions; approximation algorithm; greedy algorithm; optimal strategy; MATHEMATICS; MATEMATIK;

   Abstract : The thesis consists of four papers on combinatorial auctions and a summary. The first part is more of a practical nature and contains two papers. In the first paper, we study the performance of a caching technique in an optimal algorithm for a multi-unit combinatorial auction. READ MORE

7. 5. Resource Allocation with Potts Mean Field Neural Network Techniques

   Author : Martin Lagerholm; Beräkningsbiologi och biologisk fysik - Genomgår omorganisation; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Potts; combinatorial optimization; ANN; mean field; approximation; routing; unicast; multicast; airline crew; scheduling; ECG; NP-complete.; Matematik; Mathematics; algorithm; Systems engineering; computer technology; Data- och systemvetenskap; Fysicumarkivet A:1998:Lagerholm;

   Abstract : Potts mean field artificial neural network techniques are developed and applied to airline crew scheduling problems and routing problems. A propagator formalism in terms of Potts neurons is developed to handle global topological issues. An integrated method for identifying and classifying ECG complexes is presented. READ MORE