Sciweavers

318 search results - page 50 / 64
» On the equivalence of linear complementarity problems
Sort
View
CIAC
2010
Springer
376views Algorithms» more  CIAC 2010»
14 years 4 months ago
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
In this paper we consider a natural generalization of the well-known Max Leaf Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as input an undirected co...
Bart Jansen
ICC
2007
IEEE
14 years 1 months ago
Wireless Packet Scheduling With Soft Deadlines
— We address the problem of scheduling multiple traffic streams associated with target profiles on a shared wireless link, arising in real-time applications with soft/flexible...
Aditya Dua, Nicholas Bambos
COCO
2005
Springer
128views Algorithms» more  COCO 2005»
14 years 1 months ago
More on Noncommutative Polynomial Identity Testing
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
Andrej Bogdanov, Hoeteck Wee
DBPL
1999
Springer
114views Database» more  DBPL 1999»
13 years 11 months ago
Structured Document Transformations Based on XSL
Abstract. Based on the recursion mechanism of the XML transformation language XSL, the document transformation language DTL is defined. First the instantiation DTLreg is considere...
Sebastian Maneth, Frank Neven
AAAI
2007
13 years 9 months ago
Improved State Estimation in Multiagent Settings with Continuous or Large Discrete State Spaces
State estimation in multiagent settings involves updating an agent’s belief over the physical states and the space of other agents’ models. Performance of the previous approac...
Prashant Doshi