ADVANCED SEARCH
Advanced Search
FEEDBACK
 Please provide us with feedback
Found 1,020 of 1,394,228
|
|
Results 1 - 20 of 1,020
|
|
|
Result page:
1
2
3
4
5
6
7
8
9
10
next
>>
|
|
|
1
|
|
Factorizations of an n-cycle into two n-cycles
|
|
October 2003
|
|
European Journal of Combinatorics
, Volume 24 Issue 7
|
|
Publisher: Academic Press Ltd.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
 |
|
We prove by elementary combinatorial methods that the number of factorizations of an n-cycle (with n odd) into the product of two n-cycles is 2(n - 1)!/(n + 1). Moreover, we generalize our method to the factorization ...
|
|
2
|
|
On a conjecture of Brown concerning accessible sets
|
|
April 2005
|
|
Journal of Combinatorial Theory Series A
, Volume 110 Issue 1
|
|
Publisher: Academic Press, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
In this note we use a sequence constructed by Furstenberg in 1981 to disprove the following conjecture posed by Brown: If a set of positive numbers L is such that for any finite coloring of N there are arbitrarily long monochromatic sequences ...
Keywords: Ramsey theory, arithmetic progressions
|
|
3
|
|
4
|
|
Relax, but don't be too lazy
|
|
December 2002
|
|
Journal of Symbolic Computation
, Volume 34 Issue 6
|
|
Publisher: Academic Press, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 18 |
|
|
Assume that we wish to expand the product h = fg of two formal power series f and g. Classically, there are two types of algorithms to do this: zealous algorithms first expand f and g up to order n, multiply ...
|
|
5
|
|
A Combinational Auction Improves School Meals in Chile
|
|
November 2002
|
|
Interfaces
, Volume 32 Issue 6
|
|
Publisher: INFORMS
|
|
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 4 |
|
|
Chile's school system is using mathematical modeling to assign catering contracts in a singleround sealed-bid combinational auction. The Chilean state spends around US$180 million a year to feed 1,300,000 students from low income families, making this ...
Keywords: Games/group decisions: bidding/auctions. government: agencies, Government: agencies
|
|
6
|
|
Quadratic Sequential Computations of Boolean Mappings
|
|
July 2004
|
|
Theory of Computing Systems
, Volume 37 Issue 4
|
|
Publisher: Springer-Verlag New York, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
|
|
This paper proposes a constructive proof that any mapping on n boolean variables can be computed by a straight-line program made up of n2 assignments of the n input variables.
|
|
7
|
|
Generating a random cycle permutation
|
|
July 1988
|
|
BIT
, Volume 28 Issue 3
|
|
Publisher: BIT Computer Science and Numerical Mathematics
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
|
|
8
|
|
9
|
|
A few more r-orthogonal latin squares
|
|
July 2001
|
|
Discrete Mathematics
, Volume 238 Issue 1-3
|
|
Publisher: Elsevier Science Publishers B. V.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
|
|
|
Keywords: r-orthogonal, latin square, transversal
|
|
10
|
|
Intractability: a geometric representation
|
|
March 1994
|
|
SIGCSE '94: Proceedings of the twenty-fifth SIGCSE symposium on Computer science education
|
Publisher: ACM
 Request Permissions
|
|
Full text available: |
 Pdf
(386.85 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 5, Downloads (12 Months): 7, Downloads (Overall): 113, Citation Count: 0 |
|
|
This paper introduces a geometric representation that can be applied to illustrate the complexity of some combinatorial optimization problems. In this work, it is applied to the 0/1 knapsack problem and to a special case of a scheduling problem. This ...
|
Also published in: |
| March 1994 |
SIGCSE Bulletin |
Volume 26 Issue 1 |
|
|
11
|
|
12
|
|
A cutting plane algorithm for a clustering problem
|
|
August 1989
|
|
Mathematical Programming: Series A and B
, Volume 45 Issue 1
|
|
Publisher: Springer-Verlag New York, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 5 |
|
|
|
|
|
13
|
|
A bijection for the total area of parallelogram polyominoes
|
|
December 2004
|
|
Discrete Applied Mathematics
, Volume 144 Issue 3
|
|
Publisher: Elsevier Science Publishers B. V.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
The sum of the areas of the parallelogram polyominoes having semi-perimeter n + 2 is equal to 4n. In this paper we give a simple proof of this property by means of a mapping from the cells of parallelogram polyominoes having semiperimeter ...
|
|
14
|
|
Euclidean strings
|
|
May 2003
|
|
Theoretical Computer Science
, Volume 301 Issue 1-3
|
|
Publisher: Elsevier Science Publishers Ltd.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
|
|
A string p = p0p1...pn-1 of non-negative integers is a Euclidean string if the string (p0 + 1)p1...(pn-1 - 1) is rotationally ...
Keywords: Beatty sequence, Christoffel word, Euclidean algorithm, Fibonacci string, Lyndon word, Stern-Brocot tree, Sturmian sequence, morphism, rational mechanical sequence
|
|
15
|
|
Communications in m-connected graphs
|
|
September 1990
|
|
Discrete Applied Mathematics
, Volume 28 Issue 3
|
|
Publisher: Elsevier Science Publishers B. V.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
|
|
16
|
|
A low-level hybridization between memetic algorithm and VNS for the max-cut problem
|
|
June 2005
|
|
GECCO '05: Proceedings of the 2005 conference on Genetic and evolutionary computation
|
|
Publisher: ACM
|
|
Full text available: |
Pdf
(272.66 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 4, Downloads (12 Months): 28, Downloads (Overall): 254, Citation Count: 2 |
|
|
The Max-Cut problem consists of finding a partition of the graph nodes into two subsets, such that the sum of the edge weights having endpoints in different subsets is maximized. This NP-hard problem for non planar graphs has different applications in ...
Keywords: VNS, evolutionary algorithms, max-cut, memetic algorithms, metaheuristic
|
|
17
|
|
Combinatorial optimization - Eureka, you shrink!
|
|
January 2003
|
|
Combinatorial optimization - Eureka, you shrink!
|
|
Publisher: Springer-Verlag New York, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
|
|
18
|
|
The structure of stable marriage with indifference
|
|
October 2002
|
|
Discrete Applied Mathematics
, Volume 122 Issue 1-3
|
|
Publisher: Elsevier Science Publishers B. V.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
|
|
We consider the stable marriage problem where participants are permitted to express indifference in their preference lists (i.e., each list can be partially ordered). We prove that, in an instance where indifference takes the form of ties, the set of ...
Keywords: distributive lattice, partial order, stable marriage problem, strong stability, super-stability, tie
|
|
19
|
|
20
|
|
|
Result page:
1
2
3
4
5
6
7
8
9
10
next
>>
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Refine by Keywords
Save results to a Binder
Publisher Site