000 | 05483nam a22006255i 4500 | ||
---|---|---|---|
001 | 978-3-540-72870-2 | ||
003 | DE-He213 | ||
005 | 20240730192933.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2007 gw | s |||| 0|eng d | ||
020 |
_a9783540728702 _9978-3-540-72870-2 |
||
024 | 7 |
_a10.1007/978-3-540-72870-2 _2doi |
|
050 | 4 | _aQA76.6-76.66 | |
072 | 7 |
_aUM _2bicssc |
|
072 | 7 |
_aCOM051000 _2bisacsh |
|
072 | 7 |
_aUM _2thema |
|
082 | 0 | 4 |
_a005.11 _223 |
245 | 1 | 0 |
_aAlgorithmic Aspects in Information and Management _h[electronic resource] : _bThird International Conference, AAIM 2007, Portland, OR, USA, June 6-8, 2007, Proceedings / _cedited by Ming-Yang Kao, Xiang-Yang Li. |
250 | _a1st ed. 2007. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2007. |
|
300 |
_aXII, 428 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aInformation Systems and Applications, incl. Internet/Web, and HCI, _x2946-1642 ; _v4508 |
|
505 | 0 | _aContributed Papers To AAIM 2007 -- Solving Generalized Maximum Dispersion with Linear Programming -- Significance-Driven Graph Clustering -- An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs -- Digraph Strong Searching: Monotonicity and Complexity -- Algorithms for Counting 2-Sat Solutions and Colorings with Applications -- Collaborative Ranking: An Aggregation Algorithm for Individuals' Preference Estimation -- A Compact Encoding of Rectangular Drawings with Efficient Query Supports -- A New Efficient Algorithm for Computing the Longest Common Subsequence -- Scheduling a Flexible Batching Machine -- Global Search Method for Parallel Machine Scheduling -- Releasing and Scheduling of Lots in a Wafer Fab -- Mixed Criteria Packet Scheduling -- Efficient Algorithms for k-Disjoint Paths Problems on DAGs -- Acyclic Edge Colouring of Outerplanar Graphs -- Smallest Bipartite Bridge-Connectivity Augmentation (Extended Abstract) -- Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree -- An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths -- Online OVSF Code Assignment with Resource Augmentation -- Optimal Joint Rate and Power Allocation in CDMA Networks -- Suppressing Maximum Burst Size Throughout the Path with Non-work Conserving Schedulers -- How to Play the Majority Game with Liars -- On Satisfiability Games and the Power of Congestion Games -- The Complexity of Algorithms Computing Game Trees on Random Assignments -- An Efficient, and Fast Convergent Algorithm for Barrier Options -- An Ingenious, Piecewise Linear Interpolation Algorithm for Pricing Arithmetic Average Options -- Optimal Order Allocation with Discount Pricing -- Convex Hulls of Point-Sets and Non-uniformHypergraphs -- Optimal st-Orientations for Plane Triangulations -- Minimum Spanning Tree with Neighborhoods -- An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem -- Optimal Field Splitting with Feathering in Intensity-Modulated Radiation Therapy -- Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs -- BMA *: An Efficient Algorithm for the One-to-Some Shortest Path Problem on Road Maps -- Strip Packing vs. Bin Packing -- Probe Matrix Problems: Totally Balanced Matrices -- Efficiency of Data Distribution in BitTorrent-Like Systems -- Design of a Fuzzy PI Controller to Guarantee Proportional Delay Differentiation on Web Servers -- Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots -- A Heuristic Method for Selecting Support Features from Large Datasets -- Invited Lecture -- Game and Market Equilibria: Computation, Approximation, and Smoothed Analysis -- Ad Auctions - Current and Future Research -- Expressive Commerce and Its Application to Sourcing: How We Conducted $25 Billion of Generalized Combinatorial Auctions. | |
650 | 0 |
_aComputer programming. _94169 |
|
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 0 |
_aArtificial intelligence _xData processing. _921787 |
|
650 | 0 |
_aComputer science _xMathematics. _93866 |
|
650 | 0 |
_aDiscrete mathematics. _912873 |
|
650 | 0 |
_aNumerical analysis. _94603 |
|
650 | 0 |
_aMathematical statistics. _99597 |
|
650 | 1 | 4 |
_aProgramming Techniques. _9151861 |
650 | 2 | 4 |
_aAlgorithms. _93390 |
650 | 2 | 4 |
_aData Science. _934092 |
650 | 2 | 4 |
_aDiscrete Mathematics in Computer Science. _931837 |
650 | 2 | 4 |
_aNumerical Analysis. _94603 |
650 | 2 | 4 |
_aProbability and Statistics in Computer Science. _931857 |
700 | 1 |
_aKao, Ming-Yang. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9151862 |
|
700 | 1 |
_aLi, Xiang-Yang. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9151863 |
|
710 | 2 |
_aSpringerLink (Online service) _9151864 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540728689 |
776 | 0 | 8 |
_iPrinted edition: _z9783540839057 |
830 | 0 |
_aInformation Systems and Applications, incl. Internet/Web, and HCI, _x2946-1642 ; _v4508 _9151865 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-540-72870-2 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c94514 _d94514 |