203 search results - page 25 / 41 » Improved undecidability results on weighted timed automata |
SWAT
2004
Springer
15 years 3 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
KAIS
2008
14 years 9 months ago
2008
This paper focuses on knowledge empowered automated negotiation systems for buyer-centric multi-bilateral multi-attribute e-Procurement. We propose two knowledge empowered models,...
APWEB
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents a new method for visualizing and navigating huge graphs. The main feature of this method is that it applies Level-Of-Detail (LOD) strategy to graph visualizati...
115
click to vote
SWAT
2010
Springer
15 years 2 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...