1469 search results - page 251 / 294 » Approximate polynomial decomposition |
115
click to vote
TACAS
2007
Springer
15 years 6 months ago
2007
Springer
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
VISUALIZATION
2005
IEEE
15 years 5 months ago
2005
IEEE
This paper presents a novel method for computing simulated x-ray images, or DRRs (digitally reconstructed radiographs), of tetrahedral meshes with higher-order attenuation functio...
ATAL
2005
Springer
15 years 5 months ago
2005
Springer
In many negotiation and bargaining scenarios, a particular agent may need to interact repeatedly with another agent. Typically, these interactions take place under incomplete info...
118
click to vote
TAMC
2009
Springer
15 years 4 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
STOC
1994
ACM
15 years 4 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...