Sciweavers

441 search results - page 56 / 89
» Refinement of Time
Sort
View
EJC
2008
13 years 8 months ago
Locally constrained graph homomorphisms and equitable partitions
We explore the connection between locally constrained graph homomorphisms and degree matrices arising from an equitable partition of a graph. We provide several equivalent charact...
Jirí Fiala, Daniël Paulusma, Jan Arne ...
AUTOMATICA
2006
103views more  AUTOMATICA 2006»
13 years 8 months ago
A universal iterative learning stabilizer for a class of MIMO systems
Design of iterative learning control (ILC) often requires some prior knowledge about a system's control matrix. In some applications, such as uncalibrated visual servoing, th...
Ping Jiang, Huadong Chen, Leon C. A. Bamforth
ICTAI
2009
IEEE
14 years 3 months ago
Change Tracer: Tracking Changes in Web Ontologies
Knowledge constantly grows in scientific discourse and is revised over time by domain experts. The body of knowledge will get structured and refined as the Communities of Practice...
Asad Masood Khattak, Khalid Latif, Manhyung Han, S...
ISCC
2002
IEEE
122views Communications» more  ISCC 2002»
14 years 1 months ago
Efficiency/friendliness tradeoffs in TCP Westwood
In this paper, we propose a refinement of TCP Westwood allowing the management of the Efficiency/Friendliness-toNewReno tradeoff. We show that the refined TCP Westwood is able to ...
Ren Wang, Massimo Valla, M. Y. Sanadidi, Bryan K. ...
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
14 years 14 days ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...