Sciweavers

2354 search results - page 420 / 471
» Radio number for trees
Sort
View
TIT
1998
127views more  TIT 1998»
15 years 5 months ago
On a New Class of Codes for Identifying Vertices in Graphs
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
Mark G. Karpovsky, Krishnendu Chakrabarty, Lev B. ...
TCS
2002
15 years 5 months ago
Binary (generalized) Post Correspondence Problem
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
Vesa Halava, Tero Harju, Mika Hirvensalo
MST
2007
168views more  MST 2007»
15 years 5 months ago
Productivity of Edalat-Potts Exact Arithmetic in Constructive Type Theory
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
Milad Niqui
PVLDB
2008
94views more  PVLDB 2008»
15 years 5 months ago
Dynamic active probing of helpdesk databases
Helpdesk databases are used to store past interactions between customers and companies to improve customer service quality. One common scenario of using helpdesk database is to fi...
Shenghuo Zhu, Tao Li, Zhiyuan Chen, Dingding Wang,...
FUIN
2010
97views more  FUIN 2010»
15 years 4 months ago
Game Solution, Epistemic Dynamics and Fixed-Point Logics
Abstract. Current methods for solving games embody a form of “procedural rationality” that invites logical analysis in its own right. This paper is a brief case study of Backwa...
Johan van Benthem, Amélie Gheerbrant