Sciweavers

2478 search results - page 228 / 496
» Universality in two dimensions
Sort
View
JPDC
2006
148views more  JPDC 2006»
15 years 6 months ago
Efficient algorithm for placing a given number of base stations to cover a convex region
In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a given number of base-...
Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhaban...
CACM
2002
145views more  CACM 2002»
15 years 6 months ago
Digital city Kyoto
Abstract. We have developed a digital city for Kyoto, the old capital and cultural center of Japan, as a social information infrastructure for urban everyday life including shoppin...
Toru Ishida
EC
1998
112views ECommerce» more  EC 1998»
15 years 6 months ago
DNA Computation: Theory, Practice, and Prospects
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
Carlo C. Maley
FMSD
2010
118views more  FMSD 2010»
15 years 5 months ago
On simulation-based probabilistic model checking of mixed-analog circuits
In this paper, we consider verifying properties of mixed-signal circuits, i.e., circuits for which there is an interaction between analog (continuous) and digital (discrete) values...
Edmund M. Clarke, Alexandre Donzé, Axel Leg...
MA
2010
Springer
153views Communications» more  MA 2010»
15 years 5 months ago
Testing quasi-independence for truncation data
Quasi-independence is a common assumption for analyzing truncated data. To verify this condition, we consider a class of weighted log-rank type statistics that include existing te...
Takeshi Emura, Weijing Wang