8413 search results - page 52 / 1683 » Ordering Problem Subgoals |
AMC
2008
13 years 8 months ago
2008
We consider a control volume(covolume) method for second order elliptic PDEs with the rotated-Q1 nonconforming finite element on rectangular grids. The coefficient may a variable,...
CSR
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Ordering constraints are analogous to instances of the satisfiability problem in conjunctive normalform, but instead of a boolean assignment we consider a linear orderin...
SIU
2002
13 years 7 months ago
2002
Abstract. In order to verify and test the performance of new packing algorithms relative to existing algorithms, test problems are needed. The scope of published test instances for...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
AAAI
1990
13 years 9 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...