Sciweavers

979 search results - page 77 / 196
» Optimal instruction scheduling using integer programming
Sort
View
GECCO
2009
Springer
166views Optimization» more  GECCO 2009»
14 years 4 months ago
Genetic programming in the wild: evolving unrestricted bytecode
We describe a methodology for evolving Java bytecode, enabling the evolution of extant, unrestricted Java programs, or programs in other languages that compile to Java bytecode. B...
Michael Orlov, Moshe Sipper
GLOBECOM
2007
IEEE
14 years 4 months ago
Using MILP for Optimal Movement Planning in MANETs with Cooperative Mobility
— Rapid-deployment mobile ad-hoc networks (MANETs) are frequently characterized by common overarching mission objectives which make it reasonable to expect some degree of coopera...
Ghassen Ben Brahim, Osama Awwad, Ala I. Al-Fuqaha,...
JSAT
2006
88views more  JSAT 2006»
13 years 10 months ago
On Using Cutting Planes in Pseudo-Boolean Optimization
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean...
Vasco M. Manquinho, João P. Marques Silva
ICS
2001
Tsinghua U.
14 years 2 months ago
Reducing the complexity of the issue logic
The issue logic of dynamically scheduled superscalar processors is one of their most complex and power-consuming parts. In this paper we present alternative issue-logic designs th...
Ramon Canal, Antonio González
JUCS
2000
120views more  JUCS 2000»
13 years 9 months ago
Execution and Cache Performance of the Scheduled Dataflow Architecture
: This paper presents an evaluation of our Scheduled Dataflow (SDF) Processor. Recent focus in the field of new processor architectures is mainly on VLIW (e.g. IA-64), superscalar ...
Krishna M. Kavi, Joseph Arul, Roberto Giorgi