Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithmic Applications in Management [[electronic resource] ] : First International Conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings / / edited by Nimrod Megiddo, Yinfeng Xu, Nancy Alonstioti, Binhai Zhu
| Algorithmic Applications in Management [[electronic resource] ] : First International Conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings / / edited by Nimrod Megiddo, Yinfeng Xu, Nancy Alonstioti, Binhai Zhu |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XIV, 484 p.) |
| Disciplina | 005.1 |
| Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
| Soggetto topico |
Computer programming
Leadership Computers Algorithms Data structures (Computer science) Computer science—Mathematics Programming Techniques Business Strategy/Leadership Theory of Computation Algorithm Analysis and Problem Complexity Data Structures Discrete Mathematics in Computer Science |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lecture -- Robust Airline Fleet Assignment:Imposing Station Purity Using Station Decomposition -- Computing the Arrow-Debreu Competitive Market Equilibrium and Its Extensions -- Contributed Papers -- Complexity of Minimal Tree Routing and Coloring -- Energy Efficient Broadcasting and Multicasting in Static Wireless Ad Hoc Networks -- An Algorithm for Nonconvex Lower Semicontinuous Optimization Problems -- A Risk-Reward Competitive Analysis of the Bahncard Problem -- Competitive Strategies for On-line Production Order Disposal Problem -- Automatic Timetabling Using Artificial Immune System -- Improved Algorithms for Two Single Machine Scheduling Problems -- N-Person Noncooperative Game with Infinite Strategic Space -- On the Online Dial-A-Ride Problem with Time-Windows -- Semidefinite Programming Based Approaches to Home-Away Assignment Problems in Sports Scheduling -- Coopetitive Game, Equilibrium and Their Applications -- An Equilibrium Model in Urban Transit Riding and Fare Polices -- Optimal Timing of Firms’ R&D Investment Under Asymmetric Duopoly: A Real Options and Game-Theoretic Approach -- Improvement of Genetic Algorithm and Its Application in Optimization of Fuzzy Traffic Control Algorithm -- Facility Location in a Global View -- Existence and Uniqueness of Strong Solutions for Stochastic Age-Dependent Population -- A PTAS for Scheduling on Agreeable Unrelated Parallel Batch Processing Machines with Dynamic Job Arrivals -- Linear Time Algorithms for Parallel Machine Scheduling -- A New Method for Retrieval Based on Relative Entropy with Smoothing -- Airplane Boarding, Disk Scheduling and Space-Time Geometry -- Portfolio Selection: Possibilistic Mean-Variance Model and Possibilistic Efficient Frontier -- Design DiffServ Multicast with Selfish Agents -- Competitive Analysis of On-line Securities Investment -- Perfectness and Imperfectness of the kth Power of Lattice Graphs -- An Approximation Algorithm for Weak Vertex Cover Problem in Network Management -- Constructing Correlations in Attack Connection Chains Using Active Perturbation -- Sequence Jobs and Assign Due Dates with Uncertain Processing Times and Quadratic Penalty Functions -- Computation of Arbitrage in a Financial Market with Various Types of Frictions -- Solving SAT Problems with TA Algorithms Using Constant and Dynamic Markov Chains Length -- Efficiently Pricing European-Asian Options — Ultimate Implementation and Analysis of the AMO Algorithm -- An Incremental Approach to Link Evaluation in Topic-Driven Web Resource Discovery -- A Continuous Method for Solving Multiuser Detection in CDMA -- Wavelength Assignment for Satisfying Maximal Number of Requests in All-Optical Networks -- An Approximation Algorithm for a Facility Location Problem with Inventories and Stochastic Demands -- Dynamically Updating the Exploiting Parameter in Improving Performance of Ant-Based Algorithms -- Optimal Manpower Planning with Temporal Labor and Contract Period Constraints -- Mechanism Design for Set Cover Games When Elements Are Agents -- Graph Bandwidth of Weighted Caterpillars -- An Algorithm for Portfolio’s Value at Risk Based on Principal Factor Analysis -- An Approximation Algorithm for Embedding a Directed Hypergraph on a Ring -- On Product Covering in Supply Chain Models: Natural Complete Problems for W[3] and W[4] -- Assign Ranges in General Ad-Hoc Networks -- Inverse Problems of Some NP-Complete Problems -- Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs -- A Schedule Algebra Based Approach to Determine the K-Best Solutions of a Knapsack Problem with a Single Constraint -- Point Sets and Frame Algorithms in Management -- Mining a Class of Complex Episodes in Event Sequences -- Locating Performance Monitoring Mobile Agents in Scalable Active Networks. |
| Record Nr. | UNISA-996466129603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic applications in management : first international conference, AAIM 2005, Xian, China, June 22-25, 2005 : proceedings / / Nimrod Megiddo, Yinfeng Xu, Binhai Zhu (eds.)
| Algorithmic applications in management : first international conference, AAIM 2005, Xian, China, June 22-25, 2005 : proceedings / / Nimrod Megiddo, Yinfeng Xu, Binhai Zhu (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2005 |
| Descrizione fisica | 1 online resource (XIV, 484 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
XuYinfeng
ZhuBinhai <1966-> MegiddoNimrod |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Management science - Mathematical models
Computer algorithms |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lecture -- Robust Airline Fleet Assignment:Imposing Station Purity Using Station Decomposition -- Computing the Arrow-Debreu Competitive Market Equilibrium and Its Extensions -- Contributed Papers -- Complexity of Minimal Tree Routing and Coloring -- Energy Efficient Broadcasting and Multicasting in Static Wireless Ad Hoc Networks -- An Algorithm for Nonconvex Lower Semicontinuous Optimization Problems -- A Risk-Reward Competitive Analysis of the Bahncard Problem -- Competitive Strategies for On-line Production Order Disposal Problem -- Automatic Timetabling Using Artificial Immune System -- Improved Algorithms for Two Single Machine Scheduling Problems -- N-Person Noncooperative Game with Infinite Strategic Space -- On the Online Dial-A-Ride Problem with Time-Windows -- Semidefinite Programming Based Approaches to Home-Away Assignment Problems in Sports Scheduling -- Coopetitive Game, Equilibrium and Their Applications -- An Equilibrium Model in Urban Transit Riding and Fare Polices -- Optimal Timing of Firms’ R&D Investment Under Asymmetric Duopoly: A Real Options and Game-Theoretic Approach -- Improvement of Genetic Algorithm and Its Application in Optimization of Fuzzy Traffic Control Algorithm -- Facility Location in a Global View -- Existence and Uniqueness of Strong Solutions for Stochastic Age-Dependent Population -- A PTAS for Scheduling on Agreeable Unrelated Parallel Batch Processing Machines with Dynamic Job Arrivals -- Linear Time Algorithms for Parallel Machine Scheduling -- A New Method for Retrieval Based on Relative Entropy with Smoothing -- Airplane Boarding, Disk Scheduling and Space-Time Geometry -- Portfolio Selection: Possibilistic Mean-Variance Model and Possibilistic Efficient Frontier -- Design DiffServ Multicast with Selfish Agents -- Competitive Analysis of On-line Securities Investment -- Perfectness and Imperfectness of the kth Power of Lattice Graphs -- An Approximation Algorithm for Weak Vertex Cover Problem in Network Management -- Constructing Correlations in Attack Connection Chains Using Active Perturbation -- Sequence Jobs and Assign Due Dates with Uncertain Processing Times and Quadratic Penalty Functions -- Computation of Arbitrage in a Financial Market with Various Types of Frictions -- Solving SAT Problems with TA Algorithms Using Constant and Dynamic Markov Chains Length -- Efficiently Pricing European-Asian Options — Ultimate Implementation and Analysis of the AMO Algorithm -- An Incremental Approach to Link Evaluation in Topic-Driven Web Resource Discovery -- A Continuous Method for Solving Multiuser Detection in CDMA -- Wavelength Assignment for Satisfying Maximal Number of Requests in All-Optical Networks -- An Approximation Algorithm for a Facility Location Problem with Inventories and Stochastic Demands -- Dynamically Updating the Exploiting Parameter in Improving Performance of Ant-Based Algorithms -- Optimal Manpower Planning with Temporal Labor and Contract Period Constraints -- Mechanism Design for Set Cover Games When Elements Are Agents -- Graph Bandwidth of Weighted Caterpillars -- An Algorithm for Portfolio’s Value at Risk Based on Principal Factor Analysis -- An Approximation Algorithm for Embedding a Directed Hypergraph on a Ring -- On Product Covering in Supply Chain Models: Natural Complete Problems for W[3] and W[4] -- Assign Ranges in General Ad-Hoc Networks -- Inverse Problems of Some NP-Complete Problems -- Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs -- A Schedule Algebra Based Approach to Determine the K-Best Solutions of a Knapsack Problem with a Single Constraint -- Point Sets and Frame Algorithms in Management -- Mining a Class of Complex Episodes in Event Sequences -- Locating Performance Monitoring Mobile Agents in Scalable Active Networks. |
| Altri titoli varianti | AAIM 2005 |
| Record Nr. | UNINA-9910483347403321 |
| Berlin ; ; New York, : Springer, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Optimization and Applications [[electronic resource] ] : 7th International Conference, COCOA 2013, Chengdu, China, December 12-14, 2013, Proceedings / / edited by Peter Widmayer, Yinfeng Xu, Binhai Zhu
| Combinatorial Optimization and Applications [[electronic resource] ] : 7th International Conference, COCOA 2013, Chengdu, China, December 12-14, 2013, Proceedings / / edited by Peter Widmayer, Yinfeng Xu, Binhai Zhu |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVIII, 432 p. 94 illus.) |
| Disciplina | 005.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Computer networks Computer graphics Discrete Mathematics in Computer Science Numerical Analysis Computer Communication Networks Computer Graphics |
| ISBN | 3-319-03780-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Combinatorial optimization and its applications -- Theoretical results -- Experimental and applied research of general algorithmic interest. |
| Record Nr. | UNISA-996465558303316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Optimization and Applications : 7th International Conference, COCOA 2013, Chengdu, China, December 12-14, 2013, Proceedings / / edited by Peter Widmayer, Yinfeng Xu, Binhai Zhu
| Combinatorial Optimization and Applications : 7th International Conference, COCOA 2013, Chengdu, China, December 12-14, 2013, Proceedings / / edited by Peter Widmayer, Yinfeng Xu, Binhai Zhu |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVIII, 432 p. 94 illus.) |
| Disciplina | 005.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science - Mathematics Discrete mathematics Numerical analysis Computer networks Computer graphics Discrete Mathematics in Computer Science Numerical Analysis Computer Communication Networks Computer Graphics |
| ISBN | 3-319-03780-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Combinatorial optimization and its applications -- Theoretical results -- Experimental and applied research of general algorithmic interest. |
| Record Nr. | UNINA-9910483897103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Optimization and Applications [[electronic resource] ] : First International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings / / edited by Andreas Dress, Yinfeng Xu, Binhai Zhu
| Combinatorial Optimization and Applications [[electronic resource] ] : First International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings / / edited by Andreas Dress, Yinfeng Xu, Binhai Zhu |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XI, 392 p.) |
| Disciplina | 519.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Computer networks Computer graphics Discrete Mathematics in Computer Science Numerical Analysis Computer Communication Networks Computer Graphics |
| ISBN | 3-540-73556-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lecture -- Matchings in Graphs Variations of the Problem -- Combinatorics from Bacterial Genomes -- Contributed Papers -- An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces -- Finding the Anti-block Vital Edge of a Shortest Path Between Two Nodes -- K-Connected Target Coverage Problem in Wireless Sensor Networks -- Searching Cycle-Disjoint Graphs -- An Asymptotic PTAS for Batch Scheduling with Nonidentical Job Sizes to Minimize Makespan -- A New Dynamic Programming Algorithm for Multiple Sequence Alignment -- Energy Minimizing Vehicle Routing Problem -- On the On-Line k-Taxi Problem with Limited Look Ahead -- The Minimum Risk Spanning Tree Problem -- The Size of a Minimum Critically m-Neighbor-Scattered Graph -- A New Hybrid Algorithm for Feature Selection and Its Application to Customer Recognition -- Steiner Forests on Stochastic Metric Graphs -- On Threshold BDDs and the Optimal Variable Ordering Problem -- Communication Leading to Nash Equilibrium Through Robust Messages – S5-Knowledge Model Case – -- Fundamental Domains for Integer Programs with Symmetries -- Exact Algorithms for Generalized Combinatorial Optimization Problems -- Approximation Algorithms for k-Duplicates Combinatorial Auctions with Subadditive Bidders -- A Grid Resource Discovery Method Based on Adaptive k-Nearest Neighbors Clustering -- Algorithms for Minimum m-Connected k-Dominating Set Problem -- Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem -- Scaling, Renormalization, and Universality in Combinatorial Games: The Geometry of Chomp -- Mechanism Design by Creditability -- Infinite Families of Optimal Double-Loop Networks -- Point Sets in the Unit Square and Large Areas of Convex Hulls of Subsets of Points -- An Experimental Study of Compressed Indexing and Local Alignments of DNA -- Secure Multiparty Computations Using the 15 Puzzle -- A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem -- Single Machine Common Due Window Scheduling with Controllable Job Processing Times -- A Lower Bound on Approximation Algorithms for the Closest Substring Problem -- A New Exact Algorithm for the Two-Sided Crossing Minimization Problem -- Improved Approximation Algorithm for Connected Facility Location Problems -- The Computational Complexity of Game Trees by Eigen-Distribution -- The Minimum All-Ones Problem for Graphs with Small Treewidth -- An Exact Algorithm Based on Chain Implication for the Min-CVCB Problem -- Arc Searching Digraphs Without Jumping -- On the Complexity of Some Colorful Problems Parameterized by Treewidth -- A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model. |
| Record Nr. | UNISA-996465890503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Optimization and Applications : First International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings / / edited by Andreas Dress, Yinfeng Xu, Binhai Zhu
| Combinatorial Optimization and Applications : First International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings / / edited by Andreas Dress, Yinfeng Xu, Binhai Zhu |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XI, 392 p.) |
| Disciplina | 519.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Computer networks Computer graphics Discrete Mathematics in Computer Science Numerical Analysis Computer Communication Networks Computer Graphics |
| ISBN | 3-540-73556-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lecture -- Matchings in Graphs Variations of the Problem -- Combinatorics from Bacterial Genomes -- Contributed Papers -- An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces -- Finding the Anti-block Vital Edge of a Shortest Path Between Two Nodes -- K-Connected Target Coverage Problem in Wireless Sensor Networks -- Searching Cycle-Disjoint Graphs -- An Asymptotic PTAS for Batch Scheduling with Nonidentical Job Sizes to Minimize Makespan -- A New Dynamic Programming Algorithm for Multiple Sequence Alignment -- Energy Minimizing Vehicle Routing Problem -- On the On-Line k-Taxi Problem with Limited Look Ahead -- The Minimum Risk Spanning Tree Problem -- The Size of a Minimum Critically m-Neighbor-Scattered Graph -- A New Hybrid Algorithm for Feature Selection and Its Application to Customer Recognition -- Steiner Forests on Stochastic Metric Graphs -- On Threshold BDDs and the Optimal Variable Ordering Problem -- Communication Leading to Nash Equilibrium Through Robust Messages – S5-Knowledge Model Case – -- Fundamental Domains for Integer Programs with Symmetries -- Exact Algorithms for Generalized Combinatorial Optimization Problems -- Approximation Algorithms for k-Duplicates Combinatorial Auctions with Subadditive Bidders -- A Grid Resource Discovery Method Based on Adaptive k-Nearest Neighbors Clustering -- Algorithms for Minimum m-Connected k-Dominating Set Problem -- Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem -- Scaling, Renormalization, and Universality in Combinatorial Games: The Geometry of Chomp -- Mechanism Design by Creditability -- Infinite Families of Optimal Double-Loop Networks -- Point Sets in the Unit Square and Large Areas of Convex Hulls of Subsets of Points -- An Experimental Study of Compressed Indexing and Local Alignments of DNA -- Secure Multiparty Computations Using the 15 Puzzle -- A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem -- Single Machine Common Due Window Scheduling with Controllable Job Processing Times -- A Lower Bound on Approximation Algorithms for the Closest Substring Problem -- A New Exact Algorithm for the Two-Sided Crossing Minimization Problem -- Improved Approximation Algorithm for Connected Facility Location Problems -- The Computational Complexity of Game Trees by Eigen-Distribution -- The Minimum All-Ones Problem for Graphs with Small Treewidth -- An Exact Algorithm Based on Chain Implication for the Min-CVCB Problem -- Arc Searching Digraphs Without Jumping -- On the Complexity of Some Colorful Problems Parameterized by Treewidth -- A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model. |
| Record Nr. | UNINA-9910483474003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||