11151 search results - page 2188 / 2231 » On the Complexity of Model Expansion |
BIRTHDAY
2010
Springer
13 years 7 months ago
2010
Springer
The title of this paper, besides being a pun, can be taken to mean either the frontier of research in graph transformation, or the advantage of using graph transformation. To focus...
BPM
2010
Springer
13 years 7 months ago
2010
Springer
Ticket routing is key to the efficiency of IT problem management. Due to the complexity of many reported problems, problem tickets typically need to be routed among various expert ...
FOCS
2008
IEEE
13 years 7 months ago
2008
IEEE
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
AMAI
2008
Springer
13 years 7 months ago
2008
Springer
We study distributed boundary coverage of known environments using a team of miniature robots. Distributed boundary coverage is an instance of the multi-robot task-allocation prob...
APPML
2007
13 years 7 months ago
2007
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...