Sciweavers

329 search results - page 1 / 66
» How accurately can we model timing in a placement engine
Sort
View
DAC
2005
ACM
13 years 6 months ago
How accurately can we model timing in a placement engine?
This paper presents a novel placement algorithm for timing optimization based on a new and powerful concept, which we term differential timing analysis. Recognizing that accurate ...
Amit Chowdhary, Karthik Rajagopal, Satish Venkates...
SIBGRAPI
2007
IEEE
13 years 11 months ago
Application-independent accurate mouse placements on surfaces of arbitrary geometry
Most direct manipulation tasks rely on precise placements of the cursor on the object of interest. Commonly, this requires the knowledge of distinct application-dependent geometry...
Harlen Costa Batagelo, Shin-Ting Wu
AI
2001
Springer
13 years 9 months ago
How AI Can Help SE; or: Randomized Search Not Considered Harmful
In fast-paced software projects, engineers don’t have the time or the resources to build heavyweight complete descriptions of their software. The best they can do is lightweight ...
Tim Menzies, Harshinder Singh
ER
2005
Springer
200views Database» more  ER 2005»
13 years 10 months ago
How to Tame a Very Large ER Diagram (Using Link Analysis and Force-Directed Drawing Algorithms)
Abstract. Understanding a large schema without the assistance of persons already familiar with it (and its associated applications), is a hard and very time consuming task that occ...
Yannis Tzitzikas, Jean-Luc Hainaut
ACSAC
2006
IEEE
13 years 11 months ago
How to Automatically and Accurately Sandbox Microsoft IIS
Comparing the system call sequence of a network application against a sandboxing policy is a popular approach to detecting control-hijacking attack, in which the attacker exploits...
Wei Li, Lap-Chung Lam, Tzi-cker Chiueh