8025 search results - page 1527 / 1605 » Combinators Introduction: An Algorithm |
158
click to vote
SPAA
2004
ACM
15 years 10 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
144
click to vote
ACRI
2004
Springer
15 years 10 months ago
2004
Springer
We have investigated a problem where the goal is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type OBSTACLE, EMPTY or CRE...
161
click to vote
BIRTHDAY
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
164
Voted
CIKM
2004
Springer
15 years 10 months ago
2004
Springer
As the number of available Web pages grows, users experience increasing difficulty finding documents relevant to their interests. One of the underlying reasons for this is that mo...
135
click to vote
CP
2004
Springer
15 years 10 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...