Sciweavers

7840 search results - page 211 / 1568
» On generalized Ramsey numbers
Sort
View
ORDER
2008
61views more  ORDER 2008»
15 years 6 months ago
Partitioning Posets
Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for ever...
Viresh Patel
ICFEM
2010
Springer
15 years 5 months ago
Automating Cut-off for Multi-parameterized Systems
Abstract. Verifying that a parameterized system satisfies certain desired properties amounts to verifying an infinite family of the system instances. This problem is undecidable ...
Youssef Hanna, David Samuelson, Samik Basu, Hrides...
GD
2009
Springer
15 years 4 months ago
Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios V...
UAIS
2011
237views more  UAIS 2011»
15 years 1 months ago
Game accessibility: a survey
Over the last three decades, video games have evolved from a pastime into a force of change that is transforming the way people perceive, learn about, and interact with the world a...
Bei Yuan, Eelke Folmer, Frederick C. Harris
SCHEDULING
2010
104views more  SCHEDULING 2010»
15 years 1 months ago
A fluid approach to large volume job shop scheduling
We consider large volume job shop scheduling problems, in which there is a fixed number of machines, a bounded number of activities per job, and a large number of jobs. In large v...
Yoni Nazarathy, Gideon Weiss