Sciweavers

Share
LICS
2010
IEEE
8 years 9 months ago
The Emptiness Problem for Tree Automata with Global Constraints
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
Luis Barguñó, Carles Creus, Guillem ...
JCT
2010
72views more  JCT 2010»
8 years 9 months ago
Extensions and restrictions of Wythoff's game preserving its p positions
We consider extensions and restrictions of Wythoff’s game having exactly the same set of P positions as the original game. No strict subset of rules give the same set of P posit...
Éric Duchêne, Aviezri S. Fraenkel, Ri...
ALGOSENSORS
2010
Springer
8 years 10 months ago
Self-localization Based on Ambient Signals
We present an approach for the localization of passive nodes in a communication network using ambient radio or sound signals. In our settings the communication nodes have unknown p...
Thomas Janson, Christian Schindelhauer, Johannes W...
CG
2002
Springer
8 years 11 months ago
New Winning and Losing Positions for 7x7 HEx
Abstract. In this paper, we applied the decomposition method to obtain a new winning strategy for 7x7 Hex. We also found that some positions on the 7x7 Hex board, called trivial po...
Jing Yang, Simon X. Liao, Miroslaw Pawlak
TWC
2008
155views more  TWC 2008»
8 years 11 months ago
Distributed sensor network localization using SOCP relaxation
The goal of the sensor network localization problem is to determine positions of all sensor nodes in a network given certain pairwise noisy distance measurements and some anchor no...
Seshan Srirangarajan, Ahmed H. Tewfik, Zhi-Quan Lu...
AIL
2004
85views more  AIL 2004»
8 years 11 months ago
Normative autonomy and normative co-ordination: Declarative power, representation, and mandate
In this paper we provide a formal analysis of the idea of normative co-ordination. We argue that this idea is based on the assumption that agents can achieve flexible co-ordination...
Jonathan Gelati, Antonino Rotolo, Giovanni Sartor,...
TCS
2008
8 years 11 months ago
The Magnus-Derek game
We introduce a new combinatorial game between two players: Magnus and Derek. Initially, a token is placed at position 0 on a round table with n positions. In each round of the gam...
Zhivko Prodanov Nedev, S. Muthukrishnan
CORR
2008
Springer
86views Education» more  CORR 2008»
8 years 11 months ago
Twenty-Five Moves Suffice for Rubik's Cube
How many moves does it take to solve Rubik's Cube? Positions are known that require 20 moves, and it has already been shown that there are no positions that require 27 or mor...
Tomas Rokicki
BMCBI
2008
93views more  BMCBI 2008»
8 years 11 months ago
SlowFaster, a user-friendly program for slow-fast analysis and its application on phylogeny of Blastocystis
Background: Slow-fast analysis is a simple and effective method to reduce the influence of substitution saturation, one of the causes of phylogenetic noise and long branch attract...
Martin Kostka, Magdalena Uzlikova, Ivan Cepicka, J...
SSD
1999
Springer
158views Database» more  SSD 1999»
9 years 3 months ago
Capturing the Uncertainty of Moving-Object Representations
Spatiotemporal applications, such as fleet management and air traffic control, involving continuously moving objects are increasingly at the focus of research efforts. The repres...
Dieter Pfoser, Christian S. Jensen
books