Sciweavers

753 search results - page 18 / 151
» Completing a (k - 1)-Assignment
Sort
View
CORR
2008
Springer
106views Education» more  CORR 2008»
14 years 12 months ago
Modular difference logic is hard
In connection with machine arithmetic, we are interested in systems of constraints of the form x + k y + k . Over integers, the satisfiability problem for such systems is polynomi...
Nikolaj Bjørner, Andreas Blass, Yuri Gurevi...
ICRA
2005
IEEE
126views Robotics» more  ICRA 2005»
15 years 5 months ago
A Coverage Algorithm for Multi-robot Boundary Inspection
— This paper introduces the multi-robot boundary coverage problem, wherein a group of k robots must inspect every point on the boundary of a 2-dimensional test environment. Using...
Kjerstin Easton, Joel Burdick
DM
2007
116views more  DM 2007»
14 years 11 months ago
The Ramsey numbers for a cycle of length six or seven versus a clique of order seven
: For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest integer n such that for any graph G of order n, either G contains G1 or the complement of G contains G...
T. C. Edwin Cheng, Yaojun Chen, Yunqing Zhang, C. ...
IPL
2007
121views more  IPL 2007»
14 years 11 months ago
Parameterized complexity of the induced subgraph problem in directed graphs
In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...
Venkatesh Raman, Somnath Sikdar
COMBINATORICS
2004
94views more  COMBINATORICS 2004»
14 years 11 months ago
Even Astral Configurations
A configuration (pq, nk) is a collection of p points and n straight lines in the Euclidean plane so that every point has q straight lines passing through it and every line has k p...
Leah Wrenn Berman