# Tagged Questions

Questions about methods for empirically investigating cost measures of algorithms and data structures.

16 views

### Data normalization when control has multiple values in CS/CE

(This question was originally posted at http://academia.stackexchange.com/questions/68675 but was considered too specific for Academia.) In computer science/engineering research papers relating to ...
36 views

### How are benchmarks created?

Computing equilibria in games and the complexity thereof is imho still quite a young field in which a lot of work still is to be done (especially the former). GAMUT (2004) is a very nice "suite of ...
69 views

### Interesting small SAT problems?

I'm noodling around with making a hardware SAT solver on an FPGA, and I'm wondering if there are any interesting SAT problems smaller than, say, 50 variables both to stay within the limits of the FPGA ...
20 views

### Does it make sense to work on DIMACS framework to test TSP algorithms?

Are there any reasons to work with the DIMACS framework, such as to test algorithms, coding, and heuristics of TSP (Traveling Salesman Problem)? It is nearly 15 years since establishment of the ...
97 views

### Relative Importance in Graph Theory [closed]

I am working on an algorithm that ranks a set of nodes in a graph with respect to how relative this node is to other predefined nodes (I call them query nodes). The way how the algorithm works is ...
45 views

### Explanation of algorithms used by NAS benchmark kernels

I'm not sure if this is the appropriate forum for asking the following question. Please guide me to the right forum. I am trying to understand the algorithms used by kernels(such as Integer Sort) in ...
2k views

### What are flops and how are they benchmarked?

Apple has just proudly stated that their new mac pro will be able to give up to 7 teraflops of computing power. Flops stands for Floating Point Operations Per Second. How exactly is this benchmarked ...
5k views

### Calculating Floating point Operations Per Second(FLOPS) and Integer Operations Per Second(IOPS)

I am trying to learn some basic benchmarking. I have a loop in my Java program like, ...
How can we assert that the performance of an implementation matches the expected performance defined in terms of Big-$\mathcal{O}$ and friends by generating best/worst case inputs? I'm thinking of a ...