Sciweavers

1363 search results - page 29 / 273
» The road coloring problem
Sort
View
ICCAD
2004
IEEE
155views Hardware» more  ICCAD 2004»
15 years 6 months ago
Robust analog/RF circuit design with projection-based posynomial modeling
In this paper we propose a RObust Analog Design tool (ROAD) for post-tuning analog/RF circuits. Starting from an initial design derived from hand analysis or analog circuit synthe...
Xin Li, Padmini Gopalakrishnan, Yang Xu, Lawrence ...
CORR
2010
Springer
144views Education» more  CORR 2010»
14 years 8 months ago
Choosability in geometric hypergraphs
Given a hypergraph H = (V, E), a coloring of its vertices is said to be conflict-free if for every hyperedge S ∈ E there is at least one vertex in S whose color is distinct fro...
Panagiotis Cheilaris, Shakhar Smorodinsky
CIAC
2006
Springer
160views Algorithms» more  CIAC 2006»
15 years 1 months ago
An Approximation Algorithm for a Bottleneck Traveling Salesman Problem
Consider a truck running along a road. It picks up a load Li at point i and delivers it at i, carrying at most one load at a time. The speed on the various parts of the road in on...
Ming-Yang Kao, Manan Sanghi
ITNG
2008
IEEE
15 years 4 months ago
An Efficient Technique for Distance Computation in Road Networks
With recent advances in wireless communication and position technologies, it became possible to collect and record trajectories of moving objects. Thus, many services in road netw...
Xu Jianqiu, Victor Teixeira de Almeida, Qin Xiaoli...
IASTEDSEA
2004
14 years 11 months ago
Higher-order strategic programming: A road to software assurance
Program transformation through the repeated application of simple rewrite rules is conducive to formal verification. In practice, program transformation oftentimes requires data t...
Victor L. Winter, Steve Roach, Fares Fraij