Sciweavers

84 search results - page 16 / 17
» Total weight choosability of graphs
Sort
View
ICRA
2008
IEEE
205views Robotics» more  ICRA 2008»
14 years 1 months ago
Minimum time point assignment for coverage by two constrained robots
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
ICMCS
2005
IEEE
102views Multimedia» more  ICMCS 2005»
14 years 29 days ago
Optimal packetization of VLC and convolution coded Markov sequences
We consider the problem of packetizing a variable length coded Markov sequence into fixed length packets, while being protected by variable rate channel code. Given the total tra...
Xiaohan Wang, Xiaolin Wu
NIPS
2004
13 years 8 months ago
Large-Scale Prediction of Disulphide Bond Connectivity
The formation of disulphide bridges among cysteines is an important feature of protein structures. Here we develop new methods for the prediction of disulphide bond connectivity. ...
Pierre Baldi, Jianlin Cheng, Alessandro Vullo
ICCAD
2006
IEEE
139views Hardware» more  ICCAD 2006»
14 years 4 months ago
Analog placement with symmetry and other placement constraints
In order to handle device matching in analog circuits, some pairs of modules are required to be placed symmetrically. This paper addresses this device-level placement problem for ...
Yiu-Cheong Tam, Evangeline F. Y. Young, Chris C. N...
INFOCOM
2002
IEEE
14 years 8 days ago
Stability of a Multicast Tree
— Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwor...
Piet Van Mieghem, Milena Janic