Optimal bounds for monotonicity and Lipschitz testing over the hypercube and hypergrids

Συγγραφείς: Deeparnab Chakrabarty, C. Seshadhri

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.princeton.edu/~csesha/pubs/conf-derivative-testing.pdf.

Θεματικοί όροι: ics, Combinatorics—Combinatorial algorithms General Terms

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.487.196

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.487.196
http://www.cs.princeton.edu/~csesha/pubs/conf-derivative-testing.pdf

Optimality of an Algorithm Solving the Bottleneck Tower of Hanoi Problem

Συγγραφείς: Yefim Dinitz, Shay Solomon

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.bgu.ac.il/~shayso/Papers/ds08.pdf.

Θεματικοί όροι: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems, G.2.1 [Discrete Mathematics, Combinatorics—combinatorial algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, Optimality proofs, Tower of Hanoi ACM Reference Format

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.2358; http://www.cs.bgu.ac.il/~shayso/Papers/ds08.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.2358
http://www.cs.bgu.ac.il/~shayso/Papers/ds08.pdf

Energy-Efficient Algorithms for . . .

Συγγραφείς: Susanne Albers, HIROSHI FUJIWARA

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.pitt.edu/~kirk/cs3150spring2010/a49-albers.pdf.

Θεματικοί όροι: Categories and Subject Descriptors, F.2.2 [Analyis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Sequencing and scheduling, G.2.1 [Discrete Mathematics, Combinatorics—Combinatorial algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, Variable-speed processor, flow time, online algorithms, competitive analysis, offline algorithms, dynamic programming ACM Reference Format

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.6036

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.6036
http://www.cs.pitt.edu/~kirk/cs3150spring2010/a49-albers.pdf

Propositional satisfiability and constraint programming: A comparative survey

Συγγραφείς: Lucas Bordeaux, Youssef Hamadi, Lintao Zhang

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://research.microsoft.com/users/lintaoz/papers/survey_2006.pdf.

Θεματικοί όροι: Features—Constraints, G.2.1 [Discrete Mathematicals, Combinatorics—Combinatorial algorithms General Terms, Algorithms Additional Key Words and Phrases, Search, constraint satisfaction, SAT ACM Reference Format

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.1790; http://research.microsoft.com/users/lintaoz/papers/survey_2006.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.1790
http://research.microsoft.com/users/lintaoz/papers/survey_2006.pdf

Minimizing Total Completion Time on Uniform Machines with Deadline Constraints

Συγγραφείς: Teofilo F. Gonzalez, Joseph Y. -t. Leung, Michael Pinedo

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.ucsb.edu/~teo/papers/UnMach.pdf.

Θεματικοί όροι: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Non- numerical Algorithms and Problems—Sequencing and scheduling, G.2.1 [Discrete Mathematics, Combinatorics—Combinatorial algorithms General Terms, Algorithms, Theory, Performance Additional Key Words and Phrases, Mean flow time, uniform machines, deadline constraints, polynomial-time algorithms

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.636.7075; http://www.cs.ucsb.edu/~teo/papers/UnMach.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.636.7075
http://www.cs.ucsb.edu/~teo/papers/UnMach.pdf

Graph indexing based on discriminative frequent structure analysis

Συγγραφείς: Xifeng Yan, Philip S. Yu, Jiawei Han

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.ucsb.edu/~xyan/papers/tods05_graph.pdf.

Θεματικοί όροι: Categories and Subject Descriptors, H.2.4 [Database Management, Systems – Query process- ing, Physical Design, G.2.1 [Discrete Mathematics, Combinatorics – Combinatorial algorithms General Terms, Algorithms, Experimentation, Performance Additional Key Words and Phrases, Graph Database, Frequent Pattern, Index

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.465.9376; http://www.cs.ucsb.edu/~xyan/papers/tods05_graph.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.465.9376
http://www.cs.ucsb.edu/~xyan/papers/tods05_graph.pdf

On an Infinite Family of Solvable Hanoi Graphs

Συγγραφείς: Dany Azriel, Noam Solomon, Shay Solomon

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.bgu.ac.il/~shayso/Papers/ASS08.pdf.

Θεματικοί όροι: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems, G.2.1 [Discrete Mathematics, Combinatorics—Combinatorial algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, Optimality proofs, Tower of Hanoi ACM Reference Format

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.4840; http://www.cs.bgu.ac.il/~shayso/Papers/ASS08.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.4840
http://www.cs.bgu.ac.il/~shayso/Papers/ASS08.pdf

[Untitled]

Συγγραφείς: Peter G. Jeavonscomputing Laboratory

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.sfu.ca/~abulatov/papers/stoc01.ps.

Θεματικοί όροι: Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems--computations on discrete structures, I.2.4 [Artificial Intelligence, Knowledge Representation Formalisms and Methods--relation systems, G.2.1 [Discrete Mathematics, Combinatorics--combinatorial algorithms General Terms Algorithms, Theory Keywords constraint satisfaction problem, constraint language, complexity, tractability, NP-completeness, algebraic invariance property, relational clone

Περιγραφή αρχείου: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.1875; http://www.cs.sfu.ca/~abulatov/papers/stoc01.ps

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.1875
http://www.cs.sfu.ca/~abulatov/papers/stoc01.ps

Local Ratio: A Unified Framework for Approximation Algorithms

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.cs.technion.ac.il/~reuven/PS/survay04.ps.

Θεματικοί όροι: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems--Computations on discrete structures, Sequencing and scheduling, G.2.1 [Discrete Mathematics, Combinatorics--Combinatorial algorithms General Terms, Algorithms, Performance, Theory Additional Key Words and Phrases, Approximation algorithms, local ratio technique, scheduling, resource allocation, fractional local ratio

Περιγραφή αρχείου: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.1813; http://www.cs.technion.ac.il/~reuven/PS/survay04.ps

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.1813
http://www.cs.technion.ac.il/~reuven/PS/survay04.ps