Sciweavers

900 search results - page 135 / 180
» On Polynomial Time Computation over Unordered Structures
Sort
View
POPL
2005
ACM
14 years 9 months ago
Precise interprocedural analysis using random interpretation
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
Sumit Gulwani, George C. Necula
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 3 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
ICEBE
2007
IEEE
126views Business» more  ICEBE 2007»
14 years 3 months ago
Consumer-Centric Web Services Discovery and Subscription
Nowadays, there are a number of similar web services over the internet or intranet. They provide consumers with more choices according to their personalized QoS requirements. Howe...
Xuanzhe Liu, Li Zhou, Gang Huang, Hong Mei
RSS
2007
136views Robotics» more  RSS 2007»
13 years 10 months ago
The Stochastic Motion Roadmap: A Sampling Framework for Planning with Markov Motion Uncertainty
— We present a new motion planning framework that explicitly considers uncertainty in robot motion to maximize the probability of avoiding collisions and successfully reaching a ...
Ron Alterovitz, Thierry Siméon, Kenneth Y. ...
ECOI
2007
101views more  ECOI 2007»
13 years 8 months ago
Reasoning about taxonomies in first-order logic
Experts often disagree about the organization of biological taxa. The shifting definitions of taxonomic names complicate otherwise simple queries concerning these taxa. For examp...
David Thau, Bertram Ludäscher