Sciweavers

702 search results - page 108 / 141
» Identifying Graph Automorphisms Using Determining Sets
Sort
View
IVC
2000
179views more  IVC 2000»
14 years 11 months ago
A system to place observers on a polyhedral terrain in polynomial time
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
Maurício Marengoni, Bruce A. Draper, Allen ...
ICSE
2008
IEEE-ACM
16 years 17 days ago
Debugging reinvented: asking and answering why and why not questions about program behavior
When software developers want to understand the reason for a program's behavior, they must translate their questions about the behavior into a series of questions about code,...
Andrew Jensen Ko, Brad A. Myers
ASAP
2004
IEEE
119views Hardware» more  ASAP 2004»
15 years 3 months ago
Automatic Synthesis of Customized Local Memories for Multicluster Application Accelerators
Distributed local memories, or scratchpads, have been shown to effectively reduce cost and power consumption of application-specific accelerators while maintaining performance. Th...
Manjunath Kudlur, Kevin Fan, Michael L. Chu, Scott...
CONCUR
2008
Springer
15 years 1 months ago
Strategy Construction for Parity Games with Imperfect Information
We consider imperfect-information parity games in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., t...
Dietmar Berwanger, Krishnendu Chatterjee, Laurent ...
DPD
2002
168views more  DPD 2002»
14 years 11 months ago
Evolutionary Algorithms for Allocating Data in Distributed Database Systems
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different sites...
Ishfaq Ahmad, Kamalakar Karlapalem, Yu-Kwong Kwok,...