5244 search results - page 978 / 1049 » Structural Complexity of AvgBPP |
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
PLDI
2009
ACM
14 years 2 months ago
2009
ACM
Transactional memory (TM) is an appealing abstraction for programming multi-core systems. Potential target applications for TM, such as business software and video games, are like...
CEC
2009
IEEE
14 years 2 months ago
2009
IEEE
— Legged robots show promise for complex mobility tasks, such as navigating rough terrain, but the design of their control software is both challenging and laborious. Traditional...
WCRE
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—Enterprise Applications are complex software systems that manipulate much persistent data and interact with the user through a vast and complex user interface. In partic...
IWPEC
2009
Springer
14 years 2 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...